Axiomatizations of two types of Shapley values for games on union closed systems

DOI10.1007/s00199-010-0530-5zbMath1213.91038OpenAlexW2133216521MaRDI QIDQ535178

René van den Brink, Gerard van der Laan, Ilya V. Katsev

Publication date: 11 May 2011

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00199-010-0530-5

zbMATH Keywords

Shapley valuerestricted cooperationTU-gamepermission valuesuperior graphunion closed system

Mathematics Subject Classification ID

Noncooperative games (91A10) Differential games (aspects of game theory) (91A23) Linear-quadratic optimal control problems (49N10) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (13)

Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ The Shapley value of conjunctive-restricted games ⋮ Incomplete cooperative games with player-centered information ⋮ Harsanyi power solution for games with restricted cooperation ⋮ Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations ⋮ Comparable characterizations of four solutions for permission tree games ⋮ Games with a permission structure -- a survey on generalizations and applications ⋮ The average tree permission value for games with a permission tree ⋮ Values for Markovian coalition processes ⋮ Average tree solutions and the distribution of Harsanyi dividends ⋮ Characterization of the average tree solution and its kernel ⋮ Cooperative games on intersection closed systems and the Shapley value ⋮ Harsanyi power solutions for games on union stable systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Shapley value of a patent licensing game: the asymptotic equivalence to non-cooperative results
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• The asymptotic Shapley value for a simple market game
• Conference structures and fair allocation rules
• Games with permission structures: The conjunctive approach
• An axiomatization of the disjunctive permission value for games with a permission structure
• Axiomatizations of the Shapley value for cooperative games on antimatroids
• A characterization of the Shapley value in queueing problems
• Cooperative games on antimatroids
• Axiomatizations of the conjunctive permission value for games with permission structures
• Component efficient solutions in line-graph games with applications
• No-envy in queueing problems
• Lattices with unique irreducible decompositions
• Graphs and Cooperation in Games

This page was built for publication: Axiomatizations of two types of Shapley values for games on union closed systems