Journal ArticleDOI
Network congestion games are robust to variable demand
TLDR
The main result is that the price of anarchy bounds known for the deterministic demand game also apply to the Bayesian game with random demand, even if the travel probabilities of different commodities are arbitrarily correlated.Abstract:
We consider a non-atomic network congestion game with incomplete information in which nature decides which commodities travel. The users of a commodity do not know which other commodities travel and only have distributional information about their presence. Our main result is that the price of anarchy bounds known for the deterministic demand game also apply to the Bayesian game with random demand, even if the travel probabilities of different commodities are arbitrarily correlated. Moreover, the extension result of price of anarchy bounds for complete information games to incomplete information games in which the set of players is randomly determined can be generalized to the class of smooth games.read more
Citations
More filters
Journal Article
Worst-case equilibria
TL;DR: In a system where noncooperative agents share a common resource, the price of anarchy is proposed, which is the ratio between the worst possible Nash equilibrium and the social optimum, as a measure of the effectiveness of the system.
Journal Article
A probabilistic multipath traffic assignment model which obviates path enumeration. in: the automobile
TL;DR: In this article, a probabilistic assignment model that attempts to circumvent path enumeration is presented, which assigns trips to all reasonable paths simultaneously, in such a way that the resulting effect is identical to what would have been obtained if each path had been assigned trips separately under certain choice probability assumptions.
Proceedings ArticleDOI
Price of Anarchy in Bernoulli Congestion Games with Affine Costs
TL;DR: In this paper, the authors considered an atomic congestion game where each player participates in the game with an exogenous and known probability, independently of everybody else, or stays out and incurs no cost.
Posted Content
Approximation and Convergence of Large Atomic Congestion Games.
TL;DR: In this paper, it was shown that the Nash equilibrium flows converge in total variation towards Poisson random variables whose expected values are Wardrop equilibria of a different nonatomic game with suitably defined costs.
Journal ArticleDOI
Approximation and Convergence of Large Atomic Congestion Games
TL;DR: Cominetti and Scarsini as mentioned in this paper showed that the Nash equilibrium flows converge in total variation toward Poisson random variables whose expected values are Wardrop equilibria of a different nonatomic game with suitably defined costs.
References
More filters
Journal ArticleDOI
Equilibrium points in n-person games
TL;DR: A concept of an n -person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n -tuple ofpure strategies, one strategy being taken for each player.
Book
The Economics of Welfare
TL;DR: Aslanbeigui et al. as mentioned in this paper discussed the relationship between the national dividend and economic and total welfare, and the size of the dividend to the allocation of resources in the economy and the institutional structure governing labor market operations.
Journal ArticleDOI
Subjectivity and correlation in randomized strategies
TL;DR: This paper examined the consequences of basing mixed strategies on subjective random devices, i.e. devices on the probabilities of whose outcomes people may disagree (such as horse races, elections, etc.).
Journal ArticleDOI
How bad is selfish routing
Tim Roughgarden,Éva Tardos +1 more
TL;DR: The degradation in network performance due to unregulated traffic is quantified and it is proved that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency.