Neighbor games and the leximax solution
type: Item
instance of: scholarly article
title: Neighbor games and the leximax solution
zbMATH Open document ID: 1064.91021
author: Flip Klijn
author: Dries Vermeulen
author: Herbert Hamers
author: Tamás Solymosi
author: Joan Pere Villar
author: Stef Tijs
published in: Mathematical Methods of Operations Research
publication date: 2003-12-16T00:00:00Z
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).
reviewed by: Salvatore Modica
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 2018324
zbMATH Keywords: neighbor games
zbMATH Keywords: leximax solution
zbMATH Keywords: assignment games
MaRDI profile type: Publication
OpenAlex ID: W2142825934
DOI: 10.1007/S001860300298
description: scientific article; zbMATH DE number 2018324