TY - JOUR
T1 - On the nucleolus of neighbor games
AU - Hamers, H.
AU - Klijn, F.
AU - Solymosi, T.
AU - Nakabeppu, Y.
AU - Vermeulen, A.J.
PY - 2003/1/1
Y1 - 2003/1/1
N2 - Assignment problems are well-known problems in practice. We mention house markets, job markets, and production planning. The games of interest in this paper, the neighbor games, arise from a special class of assignment problems. We focus on the nucleolus [d. Schmeidler, siam j. Appl. Math. 17 (1969) 1163–1170], one of the most prominent core solutions. A core solution is interesting with respect to neighbor games because it divides the profit of an optimal matching in a stable manner. This paper establishes a polynomial bounded algorithm of quadratic order in the number of players for calculating the nucleolus of neighbor games.
AB - Assignment problems are well-known problems in practice. We mention house markets, job markets, and production planning. The games of interest in this paper, the neighbor games, arise from a special class of assignment problems. We focus on the nucleolus [d. Schmeidler, siam j. Appl. Math. 17 (1969) 1163–1170], one of the most prominent core solutions. A core solution is interesting with respect to neighbor games because it divides the profit of an optimal matching in a stable manner. This paper establishes a polynomial bounded algorithm of quadratic order in the number of players for calculating the nucleolus of neighbor games.
U2 - 10.1016/S0377-2217(02)00240-0
DO - 10.1016/S0377-2217(02)00240-0
M3 - Article
SN - 0377-2217
VL - 146
SP - 1
EP - 18
JO - European Journal of Operational Research
JF - European Journal of Operational Research
ER -