Abstract
Nucleolus is one of the fundamental solution concepts in cooperative game theory. There has been considerable progress in locating the nucleolus in the last three years. The paper motivates through examples how the recent algorithms work efficiently for certain structured class of coperative games. Though the data of a cooperative game grows exponentially in size with the number of players, assignment games, and balanced connected games, grow only polynomially in size, on the number of players. The algorithm for assignment games is based on an efficient graph theoretic algorithm which counts the longest paths to each vertex and trimming of cycles to quickly arrive at the lexicographic geometric centre. Connected games are solved by the technique of feasible direction, initiated in the assignment case. The sellers market corner of the core for assignment games has its counterpart, the lexmin vertex in balanced connected games. Nucleolus has also been characterized via a set of anxioms based on subgame consistency. This is exploited for standard tree games to arrive at an efficient and intuitively explainable algorithm. Improvements on the pivoting manipulations to locate coalitions with constant excess are possible and the paper initially discusses such an algorithm at the beginning.
The author would like to thank Ms Evangelista Fe, Tamas Solymosi and N. Etemadi for some critical discussions in the preparation of this paper
Partially funded by NSF-Grants: DMS-9301052 and INT 9511592, U-S India Binational Workshop on Game Theory and its Applications, Jan 2–6, 1996, Bangalore, India
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
Preview
Unable to display preview. Download preview PDF.
References
Bird, C. [1976] On cost allocation for a spanning tree: a game theoretic approach.Networks: 6, 335–350.
Curiel, I., Pederzoli, G. and S. Tijs. [1988] Sequencing Games. European Journal of Operational Research, 40: 344–351.
Curiel, I., Potters, J., Rajendra Prasad, V., Tijs, S. and B. Veltman, [1994] Sequencing and cooperation. Operations Research, 42: 366–368.
Derks, J and J. Kuipers. [1992] On the core and nucleolus of routing games. Tech Rept. University of Limburg, Maastrict.
Dragan, I. [1981] A procedure for finding the nucleolus of a cooperative n person game. Zeitschrift füir Operations Research, 25: 119–131.
Driessen, T. [1991] A survey of consistency properties in cooperative game theory. SIAM Review, 33: 43–59.
Galil, Z. [1980] Application of efficient mergeable heaps for optimization problem on treesActa Informatica,13:53–58.
Granot, D. and F. Granot. [1992] On some network flow games. Mathematics of Operations Research, 17: 792–841.
Granot, D. and G. Huberman [1984] On the core and nucleolus of minimum cost spanning tree games On the core and nucleolus of minimum cost spanning tree games, mathematical Programming, 29:323–347.
On some spanning network games. Working paper, The University of British Columbia, Vancouver, British Columbia, Canada.
Granot, D., Maschler, M., Owen, G. and W. Zhu. [1996] The kernel/nucleolus of a standard tree game. International J. Game Theory, 25:219–244.
Huberman, G. [1980] The nucleolus and the essential coalitions. Analysis and Optimization of Systems, Springer, Berlin. 416–422.
Kohlberg, E. [1972] The nucleolus as solution of a minimization problem. SIAM Journal of Applied Mathematics, 23: 34–39.
Kuhn, H. [1955] The Hungarian Method for assignment problem,Naval Reserach Logistic Quarterly, 2:83–97.
Kuipers, J. [1994] Combinatorial methods in cooperative game theory. Ph.D. Thesis, Maastricht.
Littlechild, S.C. and G. Owen. [1977] A further note on the nucleolus of the airport game International J. Game Theory, 5:91–95.
Maschler, M. [1992] The bargaining set, kernel, and nucleolus.In: Aumann, R.J. and S. Hart (eds).Handbook of Game Theory. Vol. I.Elsevier science Publ.. BV Amsterdam, North Holland. 591–667.
Maschler, M., Peleg, B. and Shapley, L. [1972] The kernel and the bargaining set for convex games. International J. Game Theory, 1: 73–93.
Maschler, M., Peleg, B. and Shapley, L. [1979] Geometric properties of the kernel, nucleolus, and related solution concepts. Mathematics of Operations Research 4: 303–338.
Megiddo, N. [1978] Computational complexity of the game theory approach to cost allocation for a tree Mathematics of Operations Research, 3:189–196.
Noltmier, H. [1975] An algorithm for the determination of the longest distances in a graph.Mathematical Programming, 9: 350–357.
Owen, G. [1974] A note on the nucleolus. International Journal of Game Theory, 3: 101–103.
Potters, J., Reijnierse, J. and Ansing, M. [1996] Computing the nucleolus by solving a prolonged simplex algorithm. Mathematics of Operations Research, 21:757–768.
Sankaran, J. [1991] On finding the nucleolus of an n-person cooperative game. International Journal of Game Theory, 19: 329–338.
Schmeidler, D. [1969] The nucleolus of a characteristic function game. SIAM Journal of Applied Mathematics, 17: 1163–1170.
Shapley, L. [1953] A value for n-person games. Contributions to the theory of games II, (Eds. H. Kuhn and A.W. Tucker). Princeton University Press, Princeton, New Jersey, 307–317.
Shapley, L. and Shubik, M. [1972] The assignment game I: the core. International Journal of Game Theory, 1: 111–130.
Sobolev, A. [1975] A characterization of optimality principles in cooperative games by functional equations (Russian). Mathematical Methods in the Social Sciences, 6: 94–151.
Solymosi, T. [1993] On computing the nucleolus of cooperative games. Ph.D. Thesis, University of Illinois at Chicago.
Solymosi, T. and Raghavan, T. [1994] An algorithm for finding the nucleolus of assignment games. International Journal of Game Theory, 23: 119–143.
Solymosi, T, Aarts, H and T. Driessen. [1994] On computing the nucleolus of a balanced connected game. Tech Rept. University of Twente.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Raghavan, T.E.S. (1997). Some Recent Algorithms for Finding the Nucleolus of Structured Cooperative Games. In: Parthasarathy, T., Dutta, B., Potters, J.A.M., Raghavan, T.E.S., Ray, D., Sen, A. (eds) Game Theoretical Applications to Economics and Operations Research. Theory and Decision Library, vol 18. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2640-4_18
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2640-4_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4780-2
Online ISBN: 978-1-4757-2640-4
eBook Packages: Springer Book Archive