Skip to main content
SpringerLink
Log in

Stable Partition Problem

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 107 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Aziz H, Brandt F, Seeding HG (2013) Computing desirable partitions in additively separable hedonic games. Artif Intell 195:316–334

    Article  MathSciNet  MATH  Google Scholar 

  2. Ballester C (2004) NP-completeness in hedonic games. Games Econ Behav 49(1):1–30

    Article  MathSciNet  MATH  Google Scholar 

  3. Banerjee S, Konishi H, Sönmez T (2001) Core in a simple coalition formation game. Soc Choice Welf 18:135–153

    Article  MathSciNet  MATH  Google Scholar 

  4. Bogomolnaia A, Jackson MO (2002) The stability of hedonic coalition structures. Games Econ Behav 38(2):201–230

    Article  MathSciNet  MATH  Google Scholar 

  5. Cechlárová K, Fleiner T, Manlove D (2005) The kidney exchange game. In: Zadnik-Stirn L, Drobne S (eds) Proceedings of SOR’05, Slovenia, pp 77–83

    Google Scholar 

  6. Cechlárová K, Hajduková J (2002) Computational complexity of stable partitions with B-preferences. Int J Game Theory 31(3):353–364

    MathSciNet  MATH  Google Scholar 

  7. Cechlárová K, Hajduková J (2004) Stable partitions with W-preferences. Discret Appl Math 138(3):333–347

    Article  MathSciNet  MATH  Google Scholar 

  8. Cechlárová K, Hajduková J (2004) Stability of partitions under WB-preferences and BW-preferences. Int J Inf Technol Decis Making 3(4):605–614. Special Issue on Computational Finance and Economics

    Google Scholar 

  9. Cechlárová K, Romero-Medina A (2001) Stability in coalition formation games. Int J Game Theory 29:487–494

    Article  MathSciNet  MATH  Google Scholar 

  10. Cechlárová K, Dahm M, Lacko V (2001) Efficiency and stability in a discrete model of country formation. J Glob Optim 20(3–4):239–256

    Article  MathSciNet  MATH  Google Scholar 

  11. Deineko VG, Woeginger GJ (2013) Two hardness results for core stability in additive hedonic coalition formation games. Discret Appl Math 161:1837–1842

    Article  MathSciNet  MATH  Google Scholar 

  12. Dimitrov D, Borm P, Hendrickx R, Sung SCh (2006) Simple priorities and core stability in hedonic games. Soc Choice Welf 26(2):421–433

    Article  MathSciNet  MATH  Google Scholar 

  13. Elkind E, Wooldridge M (2009) Hedonic coalition nets. In: Proceedings of the 8th international conference on autonomous agents and multiagent systems (AAMAS 2009), Budapest, pp 417–424

    Google Scholar 

  14. Gusfield D, Irving RW (1989) The stable marriage problem. Structure and algorithms. MIT, Cambridge

    MATH  Google Scholar 

  15. Keinänen H (2010) Stochastic local search for core membership checking in hedonic games. LNCS 6220:56–70

    Google Scholar 

  16. Roth A, Sönmez T, Ünver U (2004) Kidney exchange. Q J Econ 119:457–488

    Article  MATH  Google Scholar 

  17. Sung SCh, Dimitrov D (2007) On core membership testing for hedonic coalition formation games. Oper Res Lett 35:155–158

    Article  MathSciNet  MATH  Google Scholar 

  18. Sung SCh, Dimitrov D (2010) Computational complexity in additive hedonic games. Eur J Oper Res 203:635–639

    Article  MathSciNet  MATH  Google Scholar 

  19. Woeginger GJ (2013) A hardness result for core stability in additive hedonic games. Math Soc Sci 65:101-104

    Article  MathSciNet  MATH  Google Scholar 

  20. Shapley L, Scarf H (1974) On cores and indivisibility. J Math Econ 1:23–37

    Article  MathSciNet  MATH  Google Scholar 

  21. Yuan Y (1996) Residence exchange wanted: a stable residence exchange problem. Eur J Oper Res 90:536–546

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Institute of Mathematics, P. J. Šafárik University, Košice, Slovakia

    Katarína Cechlárová

Authors
  1. Katarína Cechlárová
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katarína Cechlárová .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Cechlárová, K. (2016). Stable Partition Problem. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_397

Download citation

Publish with us

Policies and ethics

Search

Navigation