This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Deng X, Papadimitriou C (1994) On the complexity of cooperative game solution concepts. Math Oper Res 19:257–266
Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math Oper Res 24:751–766
Faigle U, Fekete S, Hochstättler W, Kern W (1997) On the complexity of testing membership in the core of min-cost spanning tree games. Int J Game Theory 26:361–366
Fang Q, Zhu S, Cai M, Deng X (2001) Membership for core of LP games and other games. In: COCOON 2001. Lecture notes in computer science, vol 2108. Springer, Berlin/Heidelberg, pp 247–246
Goemans MX, Skutella M (2004) Cooperative facility location games. J Algorithms 50:194–214
Kalai E, Zemel E (1982) Generalized network problems yielding totally balanced games. Oper Res 30:998–1008
Kern W, Paulusma D (2003) Matching games: the least core and the nucleolus. Math Oper Res 28:294–308
Megiddo N (1978) Computational complexity and the game theory approach to cost allocation for a tree. Math Oper Res 3:189–196
Megiddo N (1978) Cost allocation for steiner trees. Networks 8:1–6
Owen G (1975) On the core of linear production games. Math Program 9:358–370
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Fang, Q. (2016). Complexity of Core. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_80
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_80
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering