Loading...
On the Nucleolus of Neighbour Games
Hamers,H.J.M. Klijn,F. Solymosi,T. Tijs,S.H. Vermeulen,D.
Hamers,H.J.M.
Klijn,F.
Solymosi,T.
Tijs,S.H.
Vermeulen,D.
Abstract
The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p4 for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games.
Description
Pagination: 22
Date
1999
Journal Title
Journal ISSN
Volume Title
Publisher
Operations research
Files
Loading...
111.pdf
Adobe PDF, 164.62 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Neighbour games, nucleolus, C63 - Computational Techniques ; Simulation Modeling, C71 - Cooperative Games, C78 - Bargaining Theory ; Matching Theory
Citation
Hamers, H J M, Klijn, F, Solymosi, T, Tijs, S H & Vermeulen, D 1999 'On the Nucleolus of Neighbour Games' CentER Discussion Paper, vol. 1999-111, Operations research, Tilburg.