Computational Complexity in Additive Hedonic Games
Author
Abstract
Suggested Citation
Download full text from publisher
Other versions of this item:
- Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
References listed on IDEAS
- Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Sung, 2006.
"Simple Priorities and Core Stability in Hedonic Games,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 26(2), pages 421-433, April.
- Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2004. "Simple Priorities and Core Stability in Hedonic Games," Discussion Paper 2004-5, Tilburg University, Center for Economic Research.
- Dinko Dimitrov & Peter Borm, 2004. "Simple Priorities and Core Stability in Hedonic Games," Econometric Society 2004 North American Summer Meetings 135, Econometric Society.
- Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Chin Sung, 2004. "Simple Priorities and Core Stability in Hedonic Games," Working Papers 2004.51, Fondazione Eni Enrico Mattei.
- Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2006. "Simple priorities and core stability in hedonic games," Other publications TiSEM 7c737a30-ac86-46ed-b210-e, Tilburg University, School of Economics and Management.
- Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
- Sung, Shao Chin & Dimitrov, Dinko, 2011. "On core membership testing for hedonic coalition formation games," Center for Mathematical Economics Working Papers 374, Center for Mathematical Economics, Bielefeld University.
- Gilboa, Itzhak & Zemel, Eitan, 1989.
"Nash and correlated equilibria: Some complexity considerations,"
Games and Economic Behavior,
Elsevier, vol. 1(1), pages 80-93, March.
- Itzhak Gilboa & Eitan Zemel, 1988. "Nash and Correlated Equilibria: Some Complexity Considerations," Discussion Papers 777, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Itzhak Gilboa & Eitan Zemel, 1989. "Nash and Correlated Equilibria: Some Complexity Considerations," Post-Print hal-00753241, HAL.
- Shao Sung & Dinko Dimitrov, 2007. "On Myopic Stability Concepts for Hedonic Games," Theory and Decision, Springer, vol. 62(1), pages 31-45, February.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
- Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001.
"Core in a simple coalition formation game,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 18(1), pages 135-153.
- Suryapratim Banerjee & Hideo Konishi & Tayfun Sonmez, 1999. "Core in a Simple Coalition Formation Game," Boston College Working Papers in Economics 449, Boston College Department of Economics.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal & Savani Rahul, 2008. "Good neighbors are hard to find: computational complexity of network formation," Post-Print hal-00268851, HAL.
- Jeroen Kuipers & Ulrich Faigle & Walter Kern, 1998. "Note Computing the nucleolus of min-cost spanning tree games is NP-hard," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 443-450.
- Dreze, J H & Greenberg, J, 1980.
"Hedonic Coalitions: Optimality and Stability,"
Econometrica,
Econometric Society, vol. 48(4), pages 987-1003, May.
- Dreze, J.H. & Greenberg, J., 1980. "Hedonic coalitions: optimality and stability," CORE Discussion Papers RP 403, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.
- Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research,
Elsevier, vol. 203(3), pages 635-639, June.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Gilboa, Itzhak, 1988.
"The complexity of computing best-response automata in repeated games,"
Journal of Economic Theory,
Elsevier, vol. 45(2), pages 342-352, August.
- Itzhak Gilboa, 1988. "The Complexity of Computing Best-Response Automata in Repeated Games," Post-Print hal-00756286, HAL.
- Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research,
Elsevier, vol. 203(3), pages 635-639, June.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Woeginger, Gerhard J., 2013. "A hardness result for core stability in additive hedonic games," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 101-104.
More about this item
Keywords
additive preferences; coalition formation; computational complexity; hedonic games; NP-hard; NP-complete;JEL classification:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
NEP fields
This paper has been announced in the following NEP Reports:- NEP-ALL-2008-10-21 (All new papers)
- NEP-GTH-2008-10-21 (Game Theory)
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:lmu:muenec:6430. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tamilla Benkelberg). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.