
A convergence analysis of the price of anarchy in atomic congestion games
This paper provides a comprehensive convergence analysis of the PoA of b...
read it

Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs
We consider an atomic congestion game with stochastic demand in which ea...
read it

Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy
Assume that a treasure is placed in one of M boxes according to a known ...
read it

PriceCoupling Games and the Generation Expansion Planning Problem
In this paper, we introduce and study a class of games called pricecoup...
read it

A CapacityPrice Game for Uncertain Renewables Resources
Renewable resources are starting to constitute a growing portion of the ...
read it

Multidefender Security Games
Stackelberg security game models and associated computational tools have...
read it

The Price of Queueing
How is efficiency affected when demand excesses over supply are signalle...
read it
Convergence of Large Atomic Congestion Games
We study the convergence of sequences of atomic unsplittable congestion games with an increasing number of players. We consider two situations. In the first setting, each player has a weight that tends to zero, in which case the mixed equilibria of the finite games converge to the set of Wardrop equilibria of the corresponding nonatomic limit game. In the second case, players have unit weights, but participate in the game with a probability that tends to zero. In this case, the mixed equilibria converge to the set of Wardrop equilibria of another nonatomic game with suitably defined costs, which can be seen as a Poisson game in the sense of Myerson (1998). In both settings we show that the price of anarchy of the sequence of games converges to the price of anarchy of the nonatomic limit. Beyond the case of congestion games, we establish a general result on the convergence of large games with random players towards a Poisson game.
READ FULL TEXT
Comments
There are no comments yet.