Article

Mathematical Methods of Operations Research

, Volume 58, Issue 2, pp 191-208

First online:

Neighbor games and the leximax solution

  • Flip KlijnAffiliated withDept. d’Economia i d’Història Econòmica, Universitat Autònoma de BarcelonaCODE and Departament d’Economia i d’Història Econòmica, Universitat Autònoma de Barcelona Email author 
  • , Dries VermeulenAffiliated withDepartment of Economics, University of Maastricht
  • , Herbert HamersAffiliated withDepartment of Econometrics and CentER, Tilburg University
  • , Tamás SolymosiAffiliated withDepartment of Operations Research, Budapest University of Economic Sciences
  • , Stef TijsAffiliated withDepartment of Econometrics and CentER, Tilburg University
  • , Joan Pere VillarAffiliated withDept. d’Economia i d’Història Econòmica, Universitat Autònoma de Barcelona

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract.

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.

Keywords

Neighbor Games Leximax Solution Assignment Games