Pareto optimal equilibria for selfish bin packing with uniform cost sharing
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-018-0323-5
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. "Strong equilibrium in cost sharing connection games," Games and Economic Behavior, Elsevier, vol. 67(1), pages 51-68, September.
- Andelman, Nir & Feldman, Michal & Mansour, Yishay, 2009. "Strong price of anarchy," Games and Economic Behavior, Elsevier, vol. 65(2), pages 289-317, March.
- Ruixin Ma & György Dósa & Xin Han & Hing-Fung Ting & Deshi Ye & Yong Zhang, 2013. "A note on a selfish bin packing problem," Journal of Global Optimization, Springer, vol. 56(4), pages 1457-1462, August.
- Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Kameda, Hisao, 2021. "Magnitude of inefficiency," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1133-1145.
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.- György Dósa & Leah Epstein, 2019. "Quality of strong equilibria for selfish bin packing with uniform cost sharing," Journal of Scheduling, Springer, vol. 22(4), pages 473-485, August.
- Le Breton, Michel & Shapoval, Alexander & Weber, Shlomo, 2021.
"A game-theoretical model of the landscape theory,"
Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 41-46.
- Weber, Shlomo & Le Breton, Michel & Shapoval, Alexander, 2020. "A Game-Theoretical Model of the Landscape Theory," CEPR Discussion Papers 14993, C.E.P.R. Discussion Papers.
- Le Breton, Michel & Shapoval, Alexander & Weber, Shlomo, 2020. "A Game-Theoretical Model of the Landscape Theory," TSE Working Papers 20-1113, Toulouse School of Economics (TSE).
- Michel Le Breton & Alexander Shapoval & Shlomo Weber, 2021. "A Game-theoretical Model of the Landscape Theory," Post-Print hal-03156677, HAL.
- Ruben Juarez & Rajnish Kumar, 2013.
"Implementing efficient graphs in connection networks,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(2), pages 359-403, October.
- Ruben Juarez & Rajnish Kumar, 2010. "Implementing Efficient Graphs in Connection Networks," Working Papers 201022, University of Hawaii at Manoa, Department of Economics.
- Ruben Juarez & Rajnish Kumar, 2012. "Implementing Efficient Graphs in Connection Networks," Working Papers 201203, University of Hawaii at Manoa, Department of Economics.
- Rajnish Kumar & Ruben Juarez, 2011. "Implementing Efficient Graphs in Connection Networks," Departmental Working Papers 2011-03, Department of Economics, Louisiana State University.
- Krzysztof R. Apt & Bart Keijzer & Mona Rahn & Guido Schäfer & Sunil Simon, 2017. "Coordination games on graphs," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(3), pages 851-877, August.
- 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.
- Martin Hoefer, 2013. "Strategic cooperation in cost sharing games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(1), pages 29-53, February.
- 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.
- Clempner, Julio B. & Poznyak, Alexander S., 2015. "Computing the strong Nash equilibrium for Markov chains games," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 911-927.
- Tami Tamir, 2023. "Cost-sharing games in real-time scheduling systems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 273-301, March.
- Tobias Harks & Max Klimm & Rolf Möhring, 2013. "Strong equilibria in games with the lexicographical improvement property," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 461-482, May.
- 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.
- Arnold, Tone & Wooders, Myrna, 2002.
"Dynamic Club Formation with Coordination,"
Economic Research Papers
269414, University of Warwick - Department of Economics.
- Tone Arnold & Myrna Wooders, 2005. "Dynamic Club Formation with Coordination," Vanderbilt University Department of Economics Working Papers 0522, Vanderbilt University Department of Economics.
- Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation With Coordination," The Warwick Economics Research Paper Series (TWERPS) 640, University of Warwick, Department of Economics.
- 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.
- Gaëtan Fournier & Marco Scarsini, 2014.
"Hotelling Games on Networks: Efficiency of Equilibria,"
Documents de travail du Centre d'Economie de la Sorbonne
14033, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Post-Print halshs-00983085, HAL.
- Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00983085, HAL.
- Page Jr., Frank H. & Wooders, Myrna, 2009.
"Strategic basins of attraction, the path dominance core, and network formation games,"
Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
- Frank H. Page, Jr. & Myrna H. Wooders, 2006. "Strategic Basins of Attraction, the Path Dominance Core, and Network Formation Games," Vanderbilt University Department of Economics Working Papers 0614, Vanderbilt University Department of Economics.
- Frank Page & Myrna Wooders, 2007. "Strategic Basins of Attraction, the Path Dominance Core, and Network Formation Games," CAEPR Working Papers 2007-020, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
- Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Object-based unawareness: Theory and applications," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
- Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco, 0. "Selfish colorful bin packing games," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-26.
- 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.
- Cong Chen & Yinfeng Xu, 0. "Coordination mechanisms for scheduling selfish jobs with favorite machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-33.
More about this item
Keywords
Bin packing; Nash equilibrium; Selfish players; Pareto optimality;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:37:y:2019:i:3:d:10.1007_s10878-018-0323-5. 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.