Mathematical Methods of Operations Research

, Volume 58, Issue 2, pp 191–208

Neighbor games and the leximax solution

Authors

    • Dept. d’Economia i d’Història EconòmicaUniversitat Autònoma de Barcelona
    • CODE and Departament d’Economia i d’Història EconòmicaUniversitat Autònoma de Barcelona
  • Dries Vermeulen
    • Department of EconomicsUniversity of Maastricht
  • Herbert Hamers
    • Department of Econometrics and CentERTilburg University
  • Tamás Solymosi
    • Department of Operations ResearchBudapest University of Economic Sciences
  • Stef Tijs
    • Department of Econometrics and CentERTilburg University
  • Joan Pere Villar
    • Dept. d’Economia i d’Història EconòmicaUniversitat Autònoma de Barcelona
Article

DOI: 10.1007/s001860300298

Cite this article as:
Klijn, F., Vermeulen, D., Hamers, H. et al. Math Meth Oper Res (2003) 58: 191. doi:10.1007/s001860300298

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 p3 for calculating the leximax solution (cf. Arin and Iñarra (1997)) of neighbor games, where p is the number of players.

Keywords

Neighbor GamesLeximax SolutionAssignment Games

Copyright information

© Springer-Verlag 2003