IDEAS home Printed from https://ideas.repec.org/r/eee/gamebe/v47y2004i2p389-403.html

Bounding the inefficiency of equilibria in nonatomic congestion games

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. José R. Correa & Nicolás Figueroa & Nicolás E. Stier-Moses, 2008. "Pricing with markups in industries with increasing marginal costs," Documentos de Trabajo 256, Centro de Economía Aplicada, Universidad de Chile.
  2. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
  3. Chen, Enxian & Qiao, Lei & Sun, Xiang & Sun, Yeneng, 2022. "Robust perfect equilibrium in large games," Journal of Economic Theory, Elsevier, vol. 201(C).
  4. Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 651-669, August.
  5. Epstein, Amir & Feldman, Michal & Mansour, Yishay, 2009. "Efficient graph topologies in network routing games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 115-125, May.
  6. Chenlan Wang & Xuan Vinh Doan & Bo Chen, 2022. "Atomic congestion games with random players: network equilibrium and the price of anarchy," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 2123-2142, October.
  7. Jonathan Kluberg & Georgia Perakis, 2012. "Generalized Quantity Competition for Multiple Products and Loss of Efficiency," Operations Research, INFORMS, vol. 60(2), pages 335-350, April.
  8. Guo, Xiaolei & Yang, Hai & Liu, Tian-Liang, 2010. "Bounding the inefficiency of logit-based stochastic user equilibrium," European Journal of Operational Research, Elsevier, vol. 201(2), pages 463-469, March.
  9. Qiang Zhang & Shi Qiang Liu & Mahmoud Masoud, 2022. "A traffic congestion analysis by user equilibrium and system optimum with incomplete information," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1391-1404, July.
  10. Feng, Zengzhe & Gao, Ziyou & Sun, Huijun, 2014. "Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 63(C), pages 31-43.
  11. Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Post-Print halshs-00983085, HAL.
  12. Xi Lin & Yafeng Yin & Fang He, 2021. "Credit-Based Mobility Management Considering Travelers’ Budgeting Behaviors Under Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 297-314, March.
  13. Cominetti, Roberto & Dose, Valerio & Scarsini, Marco, 2024. "Phase transitions of the price-of-anarchy function in multi-commodity routing games," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
  14. Roughgarden, Tim & Schoppmann, Florian, 2015. "Local smoothness and the price of anarchy in splittable congestion games," Journal of Economic Theory, Elsevier, vol. 156(C), pages 317-342.
  15. Bilò, Vittorio & Flammini, Michele & Moscardelli, Luca, 2020. "The price of stability for undirected broadcast network design with fair cost allocation is constant," Games and Economic Behavior, Elsevier, vol. 123(C), pages 359-376.
  16. Zijun Wu & Rolf H. Möhring & Yanyan Chen & Dachuan Xu, 2021. "Selfishness Need Not Be Bad," Operations Research, INFORMS, vol. 69(2), pages 410-435, March.
  17. Raimondo, Roberto, 2020. "Pathwise smooth splittable congestion games and inefficiency," Journal of Mathematical Economics, Elsevier, vol. 86(C), pages 15-23.
  18. Naimzada, A.K. & Raimondo, Roberto, 2018. "Heterogeneity and chaos in congestion games," Applied Mathematics and Computation, Elsevier, vol. 335(C), pages 278-291.
  19. Farokhi, Farhad & Johansson, Karl H., 2015. "A piecewise-constant congestion taxing policy for repeated routing games," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 123-143.
  20. Correa, José R. & Schulz, Andreas S. & Stier-Moses, Nicolás E., 2008. "A geometric approach to the price of anarchy in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 64(2), pages 457-469, November.
  21. Elodie Adida & Georgia Perakis, 2014. "The effect of supplier capacity on the supply chain profit," Annals of Operations Research, Springer, vol. 223(1), pages 1-52, December.
  22. Zhang, Fang & Meng, Qiang & Taeihagh, Araz, 2025. "Bounding the efficiency of vehicle automation in general transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 195(C).
  23. Tamer Başar & Quanyan Zhu, 2011. "Prices of Anarchy, Information, and Cooperation in Differential Games," Dynamic Games and Applications, Springer, vol. 1(1), pages 50-73, March.
  24. Chenlan Wang & Xuan Vinh Doan & Bo Chen, 0. "Atomic congestion games with random players: network equilibrium and the price of anarchy," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
  25. Chien, Steve & Sinclair, Alistair, 2011. "Convergence to approximate Nash equilibria in congestion games," Games and Economic Behavior, Elsevier, vol. 71(2), pages 315-327, March.
  26. moldovanu, benny & Hoppe-Wewetzer, Heidrun C. & Ozdenoren, Emre, 2007. "Coarse Matching and Price Discrimination," CEPR Discussion Papers 6041, C.E.P.R. Discussion Papers.
  27. Manxi Wu & Saurabh Amin & Asuman E. Ozdaglar, 2021. "Value of Information in Bayesian Routing Games," Operations Research, INFORMS, vol. 69(1), pages 148-163, January.
  28. Gusev, Vasily V., 2021. "Nash-stable coalition partition and potential functions in games with coalition structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1180-1188.
  29. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
  30. Gabriele Dragotto & Rosario Scatamacchia, 2023. "The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1143-1160, September.
  31. Deshi Ye & Lin Chen & Guochuan Zhang, 0. "On the price of anarchy of two-stage machine scheduling games," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
  32. Carmona, Guilherme & Podczeck, Konrad, 2014. "Existence of Nash equilibrium in games with a measure space of players and discontinuous payoff functions," Journal of Economic Theory, Elsevier, vol. 152(C), pages 130-178.
  33. Samitha Samaranayake & Walid Krichene & Jack Reilly & Maria Laura Delle Monache & Paola Goatin & Alexandre Bayen, 2018. "Discrete-Time System Optimal Dynamic Traffic Assignment (SO-DTA) with Partial Control for Physical Queuing Networks," Transportation Science, INFORMS, vol. 52(4), pages 982-1001, August.
  34. Riccardo Colini-Baldeschi & Roberto Cominetti & Panayotis Mertikopoulos & Marco Scarsini, 2020. "When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic," Operations Research, INFORMS, vol. 68(2), pages 411-434, March.
  35. Tsitsiklis, John N. & Xu, Yunjian, 2015. "Pricing of fluctuations in electricity markets," European Journal of Operational Research, Elsevier, vol. 246(1), pages 199-208.
  36. Hota, Ashish R. & Garg, Siddharth & Sundaram, Shreyas, 2016. "Fragility of the commons under prospect-theoretic risk attitudes," Games and Economic Behavior, Elsevier, vol. 98(C), pages 135-164.
  37. Chaofa Wang & Dongdong Li & Qing Liu & Xiaorong Wei, 2023. "Speed distribution model, expectation speed of the system and aggregation behaviour for traffic congestion," Managerial and Decision Economics, John Wiley & Sons, Ltd., vol. 44(4), pages 2175-2185, June.
  38. Sandholm, William H., 2015. "Population Games and Deterministic Evolutionary Dynamics," Handbook of Game Theory with Economic Applications,, Elsevier.
  39. Balmaceda, Felipe & Balseiro, Santiago R. & Correa, José R. & Stier-Moses, Nicolás E., 2016. "Bounds on the welfare loss from moral hazard with limited liability," Games and Economic Behavior, Elsevier, vol. 95(C), pages 137-155.
  40. Deshi Ye & Lin Chen & Guochuan Zhang, 2021. "On the price of anarchy of two-stage machine scheduling games," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 616-635, October.
  41. Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
  42. Wang, Chenlan & Doan, Xuan Vinh & Chen, Bo, 2014. "Price of anarchy for non-atomic congestion games with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 90-111.
  43. Zijun Wu & Rolf H. Moehring & Chunying Ren & Dachuan Xu, 2020. "A convergence analysis of the price of anarchy in atomic congestion games," Papers 2007.14769, arXiv.org, revised Dec 2021.
  44. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.