, Volume 58, Issue 2, pp 191-208

Neighbor games and the leximax solution

Purchase on Springer.com

$39.95 / €34.95 / £29.95*

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Neighbor 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 neighbor 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 neighbor games. After that we provide a polynomially bounded algorithm of order p 3 for calculating the leximax solution (cf. Arin and Iñarra (1997)) of neighbor games, where p is the number of players.

This author’s work has been supported by CentER and the Department of Econometrics, Tilburg University and by the Foundation for the Hungarian Higher Education and Research (AMFK).