Neighbor games and the leximax solution

DOI10.1007/S001860300298MaRDI QIDQ1416784zbMATH OpenOpenAlexFDO

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

Publication date 16 December 2003

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://cris.maastrichtuniversity.nl/ws/files/652296/guid-2f0485af-64e9-4d49-9ff8-4ee704983391-ASSET1.0.pdf

zbMATH Keywords

assignment gamesleximax solutionneighbor games

Mathematics Subject Classification ID

Cooperative games (91A12) Positional games (pursuit and evasion, etc.) (91A24)

Review text

The authors introduce neighbor games, which are assignment (cooperative) games where the players are located on a line and matchings are only possible between neighbors. The core of such games is nonempty, and the problem arises of selecting a suitable element from it. The result of the paper is an operational characterization for neighbor games of the leximax solution (an imputation with minimum maximal element among core vectors) which is directly applied to finding an algorithm that identifies the leximax vector in a finite number of steps (polynomially bounded of order equal to the number of players to the cube).

Recommendations

• On the nucleolus of neighbor games
• scientific article; zbMATH DE number 4152187
• scientific article; zbMATH DE number 1086760
• Lexicographic allocations and extreme core payoffs: the case of assignment games
• Matching Games: The Least Core and the Nucleolus

Cited in

(4)

• On the nucleolus of neighbor games
• Core stability in chain-component additive games
• The nucleolus is well-posed
• Reduced games and egalitarian solutions

This page was built for publication: Neighbor games and the leximax solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1416784)