Tristan Garrec
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tristan Garrec has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Marco Scarsini
Dipartimento di Economia e Finanza, Luiss University, 00197 Roma, Italy
2 shared publications - Etienne Boursier
CREST TML EPFL Lausanne Switzerland
1 shared publication - Vianney Perchet
Criteo AI Lab Lab Criteo AI Lab ENS Paris Saclay Ecole Polytechnique ENSAE Criteo AI UC Berkeley
1 shared publication
Latest Publications
- Open Access
Making the most of your day: online learning for optimal allocation of time
We study online learning for optimal allocation when the resource to be allocated is time. %Examples of possible applications include job scheduling for a computing server, a driver filling a day with rides, a landlord renting an estate, etc. An agent receives task proposals sequentially according to a Poisson process and can either accept or reject a proposed task. If she accepts the proposal, she is busy for the duration of the task and obtains a reward that depends on the task duration. If she rejects it, she remains on hold until a new task proposal arrives. We study the regret incurred by the agent, first when she knows her reward function but does not know the distribution of the task duration, and then when she does not know her reward function, either. This natural setting bears similarities with contextual (one-armed) bandits, but with the crucial difference that the normalized reward associated to a context depends on the whole distribution of contexts.
Open AccessMaking the most of your day: online learning for optimal allocation of time
We study online learning for optimal allocation when the resource to be allocated is time. %Examples of possible applications include job scheduling for a computing server, a driver filling a day with rides, a landlord renting an estate, etc. An agent receives task proposals sequentially according to a Poisson process and can either accept or reject a proposed task. If she accepts the proposal, she is busy for the duration of the task and obtains a reward that depends on the task duration. If she rejects it, she remains on hold until a new task proposal arrives. We study the regret incurred by the agent, first when she knows her reward function but does not know the distribution of the task duration, and then when she does not know her reward function, either. This natural setting bears similarities with contextual (one-armed) bandits, but with the crucial difference that the normalized reward associated to a context depends on the whole distribution of contexts.
- Open Access
Search for an Immobile Hider on a Stochastic Network
Harry hides on an edge of a graph and does not move from there. Sally, starting from a known origin, tries to find him as soon as she can. Harry's goal is to be found as late as possible. At any given time, each edge of the graph is either active or inactive, independently of the other edges, with a known probability of being active. This situation can be modeled as a zero-sum two-person stochastic game. We show that the game has a value and we provide upper and lower bounds for this value. Finally, by generalizing optimal strategies of the deterministic case, we provide more refined results for trees and Eulerian graphs.
Open AccessSearch for an Immobile Hider on a Stochastic Network
Harry hides on an edge of a graph and does not move from there. Sally, starting from a known origin, tries to find him as soon as she can. Harry's goal is to be found as late as possible. At any given time, each edge of the graph is either active or inactive, independently of the other edges, with a known probability of being active. This situation can be modeled as a zero-sum two-person stochastic game. We show that the game has a value and we provide upper and lower bounds for this value. Finally, by generalizing optimal strategies of the deterministic case, we provide more refined results for trees and Eulerian graphs.
- 1 September 2019
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 477 (1) , 60-84
Communicating zero-sum product stochastic games
- 1 September 2019
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 477 (1) , 60-84
Communicating zero-sum product stochastic games
- 1 August 2019
- Published by Elsevier in European Journal of Operational Research
- Vol. 277 (1) , 42-51
Continuous patrolling and hiding games
- 1 August 2019
- Published by Elsevier in European Journal of Operational Research
- Vol. 277 (1) , 42-51
Continuous patrolling and hiding games
- Open Access
Communicating Zero-Sum Product Stochastic Games
We study two classes of zero-sum stochastic games with compact action sets and a finite product state space. These two classes assume a communication property on the state spaces of the players. For strongly communicating on one side games, we prove the existence of the uniform value. For weakly communicating on both sides games, we prove that the asymptotic value, and therefore the uniform value, may fail to exist.
Open AccessCommunicating Zero-Sum Product Stochastic Games
We study two classes of zero-sum stochastic games with compact action sets and a finite product state space. These two classes assume a communication property on the state spaces of the players. For strongly communicating on one side games, we prove the existence of the uniform value. For weakly communicating on both sides games, we prove that the asymptotic value, and therefore the uniform value, may fail to exist.
- Open Access
Continuous Patrolling and Hiding Games
We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds to a dynamic formulation of this situation in the sense that the attacker chooses a time and a point to attack and the patroller chooses a continuous trajectory to maximize the probability of finding the attack point in a given time. Whereas the second game, called hiding game, corresponds to a static formulation in which both the searcher and the hider choose simultaneously a point and the searcher maximizes the probability of being at distance less than a given threshold of the hider.
Open AccessContinuous Patrolling and Hiding Games
We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds to a dynamic formulation of this situation in the sense that the attacker chooses a time and a point to attack and the patroller chooses a continuous trajectory to maximize the probability of finding the attack point in a given time. Whereas the second game, called hiding game, corresponds to a static formulation in which both the searcher and the hider choose simultaneously a point and the searcher maximizes the probability of being at distance less than a given threshold of the hider.