TY - JOUR
T1 - Neighbor games and the leximax solution
AU - Klijn, F.
AU - Vermeulen, A.J.
AU - Hamers, H.
AU - Solymosi, T.
AU - Nakabeppu, Y.
AU - Villar, J.P.
PY - 2003/1/1
Y1 - 2003/1/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.
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.
U2 - 10.1007/s001860300298
DO - 10.1007/s001860300298
M3 - Article
SN - 1432-2994
VL - 58
SP - 191
EP - 208
JO - Mathematical Methods of Operations Research
JF - Mathematical Methods of Operations Research
ER -