On the Price of Anarchy of Highly Congested Nonatomic Network Games

  title={On the Price of Anarchy of Highly Congested Nonatomic Network Games},
  author={Riccardo Colini-Baldeschi and Roberto Cominetti and Marco Scarsini},
We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we show that, under suitable conditions, the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case. The counterexamples occur in very simple parallel graphs. 
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
7 Extracted Citations
30 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 30 references

Mechanisms that govern how the price of anarchy varies with travel demand

  • S. J. O’Hare, R. D. Connors, D. P. Watling
  • Transportation Research Part B: Methodological
  • 2015
Highly Influential
3 Excerpts

The Economics of Welfare

  • Pigou, A.C..
  • Macmillan and Co., London, 1st edn.
  • 1920
Highly Influential
3 Excerpts

Stier-Moses, N.E.: A geometric approach to the price of anarchy in nonatomic congestion games

  • J. R. Correa, A. S. Schulz
  • Games Econom. Behav
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…