Bargaining sets and the core in partitioning games

DOI10.1007/s10100-008-0070-2zbMath1162.91313OpenAlexW2089159954MaRDI QIDQ1022406

Tamás Solymosi

Publication date: 22 June 2009

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-008-0070-2

zbMATH Keywords

cooperative gamescorebargaining setcombinatorial optimization gamespartitioning games

Mathematics Subject Classification ID

Cooperative games (91A12) Combinatorial optimization (90C27)

Related Items

Matching markets with middlemen under transferable utility, The core and the steady bargaining set for convex games, On bargaining sets of supplier-firm-buyer games, Editorial, The bargaining set for almost-convex games, Convergence of the approximate cores to the aspiration core in partitioning games

Cites Work

• Unnamed Item
• An equivalence theorem for a bargaining set
• Cores of partitioning games
• Necessary and sufficient conditions for balancedness in partitioning games
• Strongly balanced cooperative games
• On the bargaining set, kernel and core of superadditive games
• The reactive bargaining set of some flow games and of superadditive simple games
• The comparability of the classical and the Mas-Colell bargaining sets
• The semireactive bargaining set of a cooperative game
• Bargaining sets and the core in permutation games
• \(\Gamma\)-component additive games
• The assignment game. I: The core
• Values of Graph-Restricted Games
• Generalized Network Problems Yielding Totally Balanced Games
• On Some Network Flow Games
• Graphs and Cooperation in Games
• Introduction to the Theory of Cooperative Games