Matching Games: The Least Core and the Nucleolus

References

• Bondy J. A., Murty U. S. R.Graph Theory with Applications (1976) (Macmillan, London, and Elsevier, New York) Crossref, Google Scholar
• Deng X., Ibaraki T., Nagamochi H. Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. (1999) 24:751–766Link, Google Scholar
• Deng X., Papadimitriou C. H. On the complexity of cooperative game solution concepts. Math. Oper. Res. (1994) 19:257–266Link, Google Scholar
• Eriksson K., Karlander J. Stable outcomes of the roommate game with transferable utility. Internat. J. Game Theory (2001) 29:555–569Crossref, Google Scholar
• Faigle U., Kern W., Kuipers J. Computing the nucleolus of min-cost spanning tree games is NP-hard. Internat. J. Game Theory (1998a) 27:443–450Crossref, Google Scholar
• Faigle U., Kern W., Kuipers J. An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games. (1998b) . Memorandum No. 1464, University of Twente, Enschede, The NetherlandsGoogle Scholar
• Faigle U., Kern W., Paulusma D. Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. (2000) 52:23–38Crossref, Google Scholar
• Faigle U., Kern W., Fekete S. P., Hochstättler W. On the complexity of testing membership in the core of min-cost spanning tree games. Internat. J. Game Theory (1997) 26:361–366Crossref, Google Scholar
• Faigle U., Kern W., Fekete S. P., Hochstättler W. The nucleon of cooperative games and an algorithm for matching games. Math. Programming (1998) 83:195–211Crossref, Google Scholar
• Granot D., Granot F. Computational complexity of a cost allocation approach to a fixed cost spanning forest problem. Math. Oper. Res. (1992) 17:765–780Link, Google Scholar
• Granot D., Granot F., Zhu W. R. Characterization sets for the nucleolus. Internat. J. Game Theory (1998) 27:359–374Crossref, Google Scholar
• Granot D., Maschler M., Owen G., Zhu W. R. The kernel/nucleolus of a standard tree game. Internat. J. Game Theory (1996) 25:219–244Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1993) 2nd ed.(Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Korte B., Vygen J.Combinatorial Optimization. Theory and Algorithms (2000) (Springer-Verlag, Berlin, Germany) Google Scholar
• Lovász L., Plummer M. D.Matching Theory (1986) 121(North-Holland, Amsterdam, The Netherlands) North-Holland Mathematics StudiesGoogle Scholar
• Maschler M., Peleg B., Shapley L. S. Geometric properties of the kernel, nucleolus, and related solution concepts. Math. Oper. Res. (1979) 4:303–338Link, Google Scholar
• Megiddo N. Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. (1978) 3:189–196Link, Google Scholar
• Paulusma D.Complexity aspects of cooperative games (2001) . Ph.D. thesis, Twente University Press, Enschede, The Netherlands. http://www.ub.utwente.nl/webdocs/tw.shtmlGoogle Scholar
• Schmeidler D. The nucleolus of a characteristic function game. SIAM J. Appl. Math. (1969) 17:1163–1170Crossref, Google Scholar
• Shapley L. S., Shubik M. The assignment game I: The core. Internat. J. Game Theory (1972) 1:111–130Crossref, Google Scholar
• Solymosi T., Raghavan T. E. S. An algorithm for finding the nucleolus of assignment games. Internat. J. Game Theory (1994) 23:119–143Crossref, Google Scholar