6 papers
Making the most of your day: online learning for optimal allocation of time
Etienne Boursier, Tristan Garrec, Vianney Perchet +1
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 drive…
Efficiency of equilibria in games with random payoffs
Matteo Quattropani, Marco Scarsini
We consider normal-form games with players and two strategies for each player, where the payoffs are i.i.d. random variables with some distribution and we consider issues r…
Pure Nash Equilibria and Best-Response Dynamics in Random Games
Ben Amiet, Andrea Collevecchio, Marco Scarsini +1
In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are dra…
Search for an Immobile Hider on a Stochastic Network
Tristan Garrec, Marco Scarsini
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 po…
Decomposition of games: some strategic considerations
Joseph Abdou, Nikolaos Pnevmatikos, Marco Scarsini +1
Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of deco…
The Buck-Passing Game
Roberto Cominetti, Matteo Quattropani, Marco Scarsini
We consider a game in which players are the vertices of a directed graph. Initially, Nature chooses one player according to some fixed distribution and gives her a buck, which repr…