On weak Pareto optimality of nonatomic routing networks
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-020-00539-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
- Holzman, Ron & Law-yone (Lev-tov), Nissan, 2003. "Network structure and strong equilibrium in route selection games," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 193-205, October.
- Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
- Ron Holzman & Dov Monderer, 2015. "Strong equilibrium in network congestion games: increasing versus decreasing costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 647-666, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Xujin Chen & Zhuo Diao & Xiaodong Hu, 2022. "On weak Pareto optimality of nonatomic routing networks," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1705-1723, October.
- Satoru Fujishige & Michel X. Goemans & Tobias Harks & Britta Peis & Rico Zenklusen, 2017. "Matroids Are Immune to Braess’ Paradox," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 745-761, August.
- Epstein, Amir & Feldman, Michal & Mansour, Yishay, 2009. "Strong equilibrium in cost sharing connection games," Games and Economic Behavior, Elsevier, vol. 67(1), pages 51-68, September.
- 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.
- T. Werth & H. Sperber & S. Krumke, 2014. "Computation of equilibria and the price of anarchy in bottleneck congestion games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 687-712, December.
- Igal Milchtaich, 2021. "Internalization of social cost in congestion games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(2), pages 717-760, March.
- Kukushkin, Nikolai S., 2017. "Strong Nash equilibrium in games with common and complementary local utilities," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 1-12.
- Ron Holzman & Dov Monderer, 2015. "Strong equilibrium in network congestion games: increasing versus decreasing costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 647-666, August.
- Macault, Emilien & Scarsini, Marco & Tomala, Tristan, 2022.
"Social learning in nonatomic routing games,"
Games and Economic Behavior, Elsevier, vol. 132(C), pages 221-233.
- Emilien Macault & Marco Scarsini & Tristan Tomala, 2020. "Social Learning in Nonatomic Routing Games," Papers 2009.11580, arXiv.org, revised Oct 2021.
- Kuniavsky, Sergey & Smorodinsky, Rann, 2013. "Greediness and equilibrium in congestion games," Economics Letters, Elsevier, vol. 121(3), pages 499-503.
- 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.
- Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," Post-Print hal-00718046, HAL.
- Igal Milchtaich, 2015. "Network topology and equilibrium existence in weighted network congestion games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 515-541, August.
- Yannai A. Gonczarowski & Moshe Tennenholtz, 2014. "Noncooperative Market Allocation and the Formation of Downtown," Discussion Paper Series dp663, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Yannai A. Gonczarowski & Moshe Tennenholtz, 2014. "Cascading to Equilibrium: Hydraulic Computation of Equilibria in Resource Selection Games," Discussion Paper Series dp673, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
- Andelman, Nir & Feldman, Michal & Mansour, Yishay, 2009. "Strong price of anarchy," Games and Economic Behavior, Elsevier, vol. 65(2), pages 289-317, March.
- Leah Epstein & Sven O. Krumke & Asaf Levin & Heike Sperber, 2011. "Selfish bin coloring," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 531-548, November.
- Di Feng & Bettina Klaus, 2022.
"Preference revelation games and strict cores of multiple‐type housing market problems,"
International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
- Di Feng & Bettina Klaus, 2021. "Preference revelation games and strict cores of multiple-type housing market problems," Cahiers de Recherches Economiques du Département d'économie 21.10, Université de Lausanne, Faculté des HEC, Département d’économie.
- Mark Voorneveld & Peter Borm & Freek Van Megen & Stef Tijs & Giovanni Facchini, 1999.
"Congestion Games And Potentials Reconsidered,"
International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 1(03n04), pages 283-299.
- Voorneveld, M. & Borm, P.E.M. & van Megen, F.J.C. & Tijs, S.H. & Facchini, G., 1999. "Congestion Games and Potentials Reconsidered," Discussion Paper 1999-98, Tilburg University, Center for Economic Research.
- Voorneveld, M. & Borm, P.E.M. & van Megen, F.J.C. & Tijs, S.H. & Facchini, G., 1999. "Congestion games and potentials reconsidered," Other publications TiSEM a2b8c559-8a5b-4a4a-8205-9, Tilburg University, School of Economics and Management.
- Voorneveld, M. & Borm, P.E.M. & van Megen, F.J.C. & Tijs, S.H. & Facchini, G., 1999. "Congestion Games and Potentials Reconsidered," Other publications TiSEM 1d647323-c17d-41e9-a4d5-8, Tilburg University, School of Economics and Management.
- Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.
More about this item
Keywords
Nonatomic selfish routing; Nash equilibrium; Weakly Pareto optimal; Multi-commodity network;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00539-7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.