activity
20162025
most citedMonotonicity of Equilibria in Nonatomic Congestion Games

6 citations · 13 across the 6 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.GT2019

The Price of Anarchy in Routing Games as a Function of the Demand

Roberto Cominetti, Valerio Dose, Marco Scarsini

The price of anarchy has become a standard measure of the efficiency of equilibria in games. Most of the literature in this area has focused on establishing worst-case bounds for s…

cs.GT2019

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…

cs.GT2019

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…

cs.GT2019

Ordinary and Prophet Planning under Uncertainty in Bernoulli Congestion Games

Roberto Cominetti, Marco Scarsini, Marc Schröder +1

We consider an atomic congestion game in which each player participates in the game with an exogenous and known probability , independently of everybody else, or…

cs.GT2019

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…