Neighbor games and the leximax solution

Flip Klijn, Dries Vermeulen, Herbert Hamers, Tamás Solymosi, Stef Tijs, Joan Pere Villar

    Research output: Contribution to journalArticleResearchpeer-review

    3 Citations (Scopus)

    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. © Springer-Verlag 2003.
    Original languageEnglish
    Pages (from-to)191-208
    JournalMathematical Methods of Operations Research
    Volume58
    Issue number2
    DOIs
    Publication statusPublished - 1 Nov 2003

    Keywords

    • Assignment Games
    • Leximax Solution
    • Neighbor Games

    Fingerprint

    Dive into the research topics of 'Neighbor games and the leximax solution'. Together they form a unique fingerprint.

    Cite this