This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

On the nucleolus of neighbour games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Hamers, H.
Klijn, F.
Solymosi, T. (Tilburg University, Center for Economic Research)

Additional information is available for the following registered author(s):

Abstract

The 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 p 4 for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bounded algorithm of order p 2 for calculating the nucleolus of neighbour games.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://arno.uvt.nl/show.cgi?fid=3992
File Format: application/postscript
File Function:
Download Restriction: no
File URL: http://arno.uvt.nl/show.cgi?fid=3991
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 111.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 1999
Date of revision:
Handle: RePEc:dgr:kubcen:1999111

Contact details of provider:
Web page: http://center.uvt.nl

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords:

Other versions of this item:

Find related papers by JEL classification:
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - 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

This paper has been announced in the following NEP Reports:

References listed on IDEAS
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.:
  1. Klijn, F. & Vermeulen, D. & Hamers, H., 1999. "Neigbour games and the leximax solution," Discussion Paper 110, Tilburg University, Center for Economic Research. [Downloadable!]
  2. repec:fth:tilbur:99110 is not listed on IDEAS
  3. 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.
Full references

Cited by:
(explanations, 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.)

  1. Klijn, F. & Vermeulen, D. & Hamers, H., 1999. "Neigbour games and the leximax solution," Discussion Paper 110, Tilburg University, Center for Economic Research. [Downloadable!]
  2. Velzen, S. van & Hamers, H.J.M. & Solymosi, T., 2004. "Core stability in chain-component additive games," Discussion Paper 101, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? The most prolific authors have over 700 items listed on IDEAS.

This page was last updated on 2009-10-29.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.