Advanced Search
MyIDEAS: Login to save this paper or follow this series

On the Nucleolus of Neighbour Games


Author Info

  • Hamers, H.J.M.
  • Klijn, F.
  • Solymosi, T.
  • Tijs, S.H.
  • Vermeulen, D.

    (Tilburg University, Center for Economic Research)


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 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 Info

If 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.
File URL:
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

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

as in new window
Date of creation: 1999
Date of revision:
Handle: RePEc:dgr:kubcen:1999111

Contact details of provider:
Web page:

Related research

Keywords: Neighbour games; nucleolus;

Other versions of this item:

Find related papers by JEL classification:

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.:
as in new window
  1. 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.
  2. repec:fth:tilbur:99110 is not listed on IDEAS
  3. 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.
  4. Flip Klijn & Dries Vermeulen & Herbert Hamers & Tamás Solymosi & Stef Tijs & Joan Pere Villar, 2003. "Neighbor games and the leximax solution," Computational Statistics, Springer, vol. 58(2), pages 191-208, November.
  5. 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.
Full references (including those not matched with items on IDEAS)


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Flip Klijn & Dries Vermeulen & Herbert Hamers & Tamás Solymosi & Stef Tijs & Joan Pere Villar, 2003. "Neighbor games and the leximax solution," Computational Statistics, Springer, vol. 58(2), pages 191-208, November.
  2. Velzen, S. van & Hamers, H.J.M. & Solymosi, T., 2004. "Core Stability in Chain-Component Additive Games," Discussion Paper 2004-101, Tilburg University, Center for Economic Research.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:1999111. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.