Core stability in chain-component additive games
From MaRDI portal
Publication:2483120
DOI10.1016/j.geb.2007.02.005zbMath1135.91320OpenAlexW3125418446MaRDI QIDQ2483120
Tamás Solymosi, Bas van Velzen, Herbert Hamers
Publication date: 28 April 2008
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/ws/files/629369/101.pdf
Related Items (4)
Accessibility and stability of the coalition structure core ⋮ New characterizations for largeness of the core ⋮ Balancedness conditions for exact games ⋮ Multi-sided assignment games on \(m\)-partite graphs
Cites Work
- Unnamed Item
- On the convexity of precedence sequencing games
- Sequencing games
- Cooperative games with large cores
- Strongly balanced cooperative games
- Prosperty properties of TU-games
- Large cores and exactness
- Assignment games with stable core
- Neighbor games and the leximax solution
- Computing the nucleolus of some combinatorially-structured games.
- On the nucleolus of neighbor games
- \(\Gamma\)-component additive games
- On games corresponding to sequencing situations with ready times
- Stability and largeness of core for symmetric games
- Cores of convex games
- On Computing the Nucleolus of a Balanced Connected Game
- Sequencing and Cooperation
- A game with no solution
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Core stability in chain-component additive games
