On the nucleolus of neighbor games
From MaRDI portal
Publication:1869507
DOI10.1016/S0377-2217(02)00240-0zbMath1011.91024MaRDI QIDQ1869507
Dries Vermeulen, Herbert Hamers, Flip Klijn, Tamás Solymosi, S. H. Tijs
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00240-0
Related Items
Finding the nucleoli of large cooperative games, An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure, Operations research games: A survey. (With comments and rejoinder), Computing the nucleolus of weighted voting games in pseudo-polynomial time, Finding and verifying the nucleolus of cooperative games, A heuristic procedure for computing the nucleolus, Core stability in chain-component additive games
Cites Work
- Unnamed Item
- Assignment games satisfy the CoMa-property
- An algorithm for finding the nucleolus of assignment games
- Neighbor games and the leximax solution
- \(\Gamma\)-component additive games
- The assignment game. I: The core
- On Computing the Nucleolus of a Balanced Connected Game
- Sequencing and Cooperation
- The Nucleolus of a Characteristic Function Game
- The kernel of a cooperative game
- On the Nucleolus of a Characteristic Function Game