Neighbor games and the leximax solution

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

doi:10.1007/s001860300298

Neighbor games and the leximax solution

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

Research output: Contribution to journal › Article › Research › peer-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 language	English
Pages (from-to)	191-208
Journal	Mathematical Methods of Operations Research
Volume	58
Issue number	2
DOIs	https://doi.org/10.1007/s001860300298
Publication status	Published - 1 Nov 2003

Keywords

Assignment Games
Leximax Solution
Neighbor Games

Access to Document

10.1007/s001860300298

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

Cite this

@article{7d0d400eb1be46cda702af0480bb1d9f,

title = "Neighbor games and the leximax solution",

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{\~n}arra (1997)) of neighbor games, where p is the number of players. {\textcopyright} Springer-Verlag 2003.",

keywords = "Assignment Games, Leximax Solution, Neighbor Games",

author = "Flip Klijn and Dries Vermeulen and Herbert Hamers and Tam{\'a}s Solymosi and Stef Tijs and Villar, {Joan Pere}",

year = "2003",

month = nov,

day = "1",

doi = "10.1007/s001860300298",

language = "English",

volume = "58",

pages = "191--208",

journal = "Mathematical Methods of Operations Research",

issn = "1432-2994",

number = "2",

}

TY - JOUR

T1 - Neighbor games and the leximax solution

AU - Klijn, Flip

AU - Vermeulen, Dries

AU - Hamers, Herbert

AU - Solymosi, Tamás

AU - Tijs, Stef

AU - Villar, Joan Pere

PY - 2003/11/1

Y1 - 2003/11/1

N2 - 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.

AB - 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.

KW - Assignment Games

KW - Leximax Solution

KW - Neighbor Games

U2 - 10.1007/s001860300298

DO - 10.1007/s001860300298

M3 - Article

VL - 58

SP - 191

EP - 208

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

SN - 1432-2994

IS - 2

ER -