Advanced Search
MyIDEAS: Login

Computational Complexity in Additive Hedonic Games

Contents:

Author Info

  • Sung, Shao-Chin
  • Dimitrov, Dinko

Abstract

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. Furthermore, the corresponding decision problems with respect to the existence of a Nash stable coalition structure and of an individually stable coalition structure turn out to be NP-complete in the strong sense.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://epub.ub.uni-muenchen.de/6430/1/Complexity.pdf
Download Restriction: no

Bibliographic Info

Paper provided by University of Munich, Department of Economics in its series Discussion Papers in Economics with number 6430.

as in new window
Length:
Date of creation: 07 Oct 2008
Date of revision:
Handle: RePEc:lmu:muenec:6430

Contact details of provider:
Postal: Ludwigstr. 28, 80539 Munich, Germany
Phone: +49-(0)89-2180-3405
Fax: +49-(0)89-2180-3510
Web page: http://www.vwl.uni-muenchen.de
More information through EDIRC

Related research

Keywords: additive preferences; coalition formation; computational complexity; hedonic games; NP-hard; NP-complete;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2006. "Simple priorities and core stability in hedonic games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-194178, Tilburg University.
  2. Gilboa, Itzhak & Zemel, Eitan, 1989. "Nash and correlated equilibria: Some complexity considerations," Games and Economic Behavior, Elsevier, vol. 1(1), pages 80-93, March.
  3. 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.
  4. Shao Chin Sung & Dinko Dimitrov, 2005. "On core membership testing for hedonic coalition formation games," Working Papers 374, Bielefeld University, Center for Mathematical Economics.
  5. 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.
  6. 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.
  7. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
  8. Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
Full references (including those not matched with items on IDEAS)

Citations

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

Cited by:
  1. Woeginger, Gerhard J., 2013. "A hardness result for core stability in additive hedonic games," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 101-104.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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: (Alexandra Frank).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.