On the nucleolus of neighbor games
AbstractThe class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p4 for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Maastricht University in its series Open Access publications from Maastricht University with number urn:nbn:nl:ui:27-3951.
Date of creation: 2003
Date of revision:
Publication status: Published in European journal of operational research (2003) v.146, p.1-18
Contact details of provider:
Web page: http://www.maastrichtuniversity.nl/web/Home.htm
Other versions of this item:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Pere Villar, Joan, 2002.
"Assignment Games Satisfy the CoMa-Property,"
Games and Economic Behavior,
Elsevier, vol. 38(2), pages 231-239, February.
- Klijn, F. & Vermeulen, D. & Hamers, H.J.M. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 1999.
"Neighbour Games and the Leximax Solution,"
1999-110, Tilburg University, Center for Economic Research.
- Klijn, Flip & Vermeulen, Dries & Hamers, Herbert & Solymosi, Tamas & Tijs, Stef, 2003. "Neighbor games and the leximax solution," Open Access publications from Maastricht University urn:nbn:nl:ui:27-3972, Maastricht University.
- Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer, vol. 23(2), pages 119-43.
- repec:fth:tilbur:99110 is not listed on IDEAS
- Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1994. "Sequencing and cooperation," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154192, Tilburg University.
- van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008.
"Core stability in chain-component additive games,"
Games and Economic Behavior,
Elsevier, vol. 62(1), pages 116-139, January.
- Klijn, Flip & Vermeulen, Dries & Hamers, Herbert & Solymosi, Tamas & Tijs, Stef, 2003.
"Neighbor games and the leximax solution,"
Open Access publications from Maastricht University
urn:nbn:nl:ui:27-3972, Maastricht University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (J.Odekerken).
If references are entirely missing, you can add them using this form.