Computing the nucleolus of some combinatorially-structured games

Mathematical Programming, Series B

Volumn 88, Issue 3, 2000, Pages 541-563

  Kuipers, Jeroen ^a   Solymosi, Tamás ^b   Aarts, Harry ^c  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

(pre)nucleolus; Computational complexity; TU games

Indexed keywords

EID: 0000175419     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011385     Document Type: Article

References (20)

1. Ann, J., Feltkamp, V. (1997): The nucleolus and kernel of veto-rich transferable utility games. Int. J. Game Theory 26, 61-74
2. Bird, C.G. (1976): On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335-350
3. Le Breton, M., Owen, G., Weber, S. (1992): Strongly balanced cooperative games. Int. J. Game Theory 20, 419-427
4. Curiel, I.J., Pederzoli, G., Tijs, S.H. (1989): Sequencing games. Eur. J. Oper. Res. 40, 344-351
5. Curiel, I.J., Potters, J.A.M., Prasad, R., Tijs, S.H., Veltman, B. (1993): Cooperation in one machine scheduling. ZOR-Methods Models Oper. Res. 38, 113-129
6. Derks, J.J.M., Kuipers, J. (1992): On the core and nucleolus of routing games. Memorandum M 92-07, Maastricht University, The Netherlands
7. Galil, Z. (1980): Applications of efficiently mergeable heaps for optimization problems on trees. Acta Inf. 13, 53-58
8. Granot, D., Huberman, G. (1981): Minimum cost spanning tree games. Math. Program. 21, 1-18
9. Granot, D., Huberman, G. (1984): On the core and nucleolus of minimum cost spanning tree games. Math. Program. 29, 323-347
10. Huberman, G. (1980): The nucleolus and the essential coalitions. In: Analysis and Optimizations of Systems, pp. 416-422, Springer, Berlin
11. Kuipers, J. (1994): Combinatorial methods in cooperative game theory. Ph.D. thesis, Maastricht
12. Maschler, M., Peleg, B., Shapley, L.S. (1979): Geometric properties of the kernel, nucleolus, and related solution concepts. Math. Oper. Res. 4, 303-338
13. Megiddo, N. (1978): Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. 3, 189-196
14. Muto, S., Nakayama, M., Potters, J.A.M., Tijs, S.H. (1988): On big boss games. The Economic Studies Quarterly 39, 303-321
15. Muto, S., Potters, J.A.M., Tijs, S.H. (1989): Information market games. Int. J. Game Theory 18, 209-226
16. Potters, J.A.M., Curiel, I.J., Tijs, S.H. (1992): Traveling salesman games. Math. Program. 53, 199-211
17. Potters, J.A.M., Poos, R., Tijs, S.H., Muto, S. (1987): Clan games. Games Econ. Behav. 1, 275-293
18. Potters, J.A.M., Reijnierse, J. (1995): Γ-component additive games. Int. J. Game Theory 24, 49-56
19. Schmeidler, D. (1969): The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17, 1163-1170
20. Solymosi, T., Aarts, H., Driessen, T.S.H. (1999): On computing the nucleolus of a balanced connected game. To appear in: Math. Oper. Res.