On the Nucleolus of Neighbour Games

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

Research output: Working paperDiscussion paperOther research output

246 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages22
Publication statusPublished - 1999

Publication series

NameCentER Discussion Paper


  • Neighbour games
  • nucleolus


Dive into the research topics of 'On the Nucleolus of Neighbour Games'. Together they form a unique fingerprint.

Cite this