Neighbour Games and the Leximax Solution

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

Research output: Working paperDiscussion paperOther research output

246 Downloads (Pure)

Abstract

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbour games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component additive games (Curiel et al. (1994)). We first present some elementary features of neighbour games. After that we provide a polynomially bounded algorithm of order p3 for calculating the leximax solution (cf. Arin and I˜narra (1997)) of neighbour games, where p is the number of players.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages19
Volume1999-110
Publication statusPublished - 1999

Publication series

NameCentER Discussion Paper
Volume1999-110

Keywords

  • Neighbour games
  • Leximax solution
  • assignment games

Fingerprint Dive into the research topics of 'Neighbour Games and the Leximax Solution'. Together they form a unique fingerprint.

Cite this