The average tree permission value for games with a permission tree
From MaRDI portal
Publication:2256861
DOI10.1007/s00199-013-0796-5zbMath1319.91049OpenAlexW3082770045MaRDI QIDQ2256861
Gerard van der Laan, René van den Brink, P. Jean-Jacques Herings, Adolphus J. J. Talman
Publication date: 23 February 2015
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/ws/files/35435514/Herings_2015_Average_Tree_Permission_Value.pdf
Related Items
A monotonic and merge-proof rule in minimum cost spanning tree situations, The Need for Permission, the Power to Enforce, and Duality in Cooperative Games with a Hierarchy, Networks, Communication and Hierarchy: Applications to Cooperative Games, From hierarchies to levels: new solutions for games with hierarchical structure, Allocation rules for multi-choice games with a permission tree structure, Axiomatic analysis of liability problems with rooted-tree networks in tort law, Discounted tree solutions, Comparable characterizations of four solutions for permission tree games, Games with a permission structure -- a survey on generalizations and applications, Rejoinder on: ``Games with a permission structure -- a survey on generalizations and applications, Characterization of the average tree solution and its kernel
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficiency and collusion neutrality in cooperative games and networks
- Axiomatizations of two types of Shapley values for games on union closed systems
- The covering values for acyclic digraph games
- 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
- Rooted-tree solutions for tree games
- The theory of convex geometries
- Games with permission structures: The conjunctive approach
- The Shapley value for cooperative games under precedence constraints
- Collusion properties of values
- An axiomatization of the disjunctive permission value for games with a permission structure
- Tree-connected peer group situations and peer group games
- Equal treatment, symmetry and Banzhaf value axiomatizations
- The average tree solution for multi-choice forest games
- Values for Markovian coalition processes
- A characterization of the Shapley value in queueing problems
- Cooperative games on antimatroids
- Axiomatizations of the conjunctive permission value for games with permission structures
- Collusion, quarrel, and the Banzhaf value
- The average tree solution for cooperative games with communication structure
- A Shapley value for games with restricted coalitions
- Sharing a polluted river
- Component efficient solutions in line-graph games with applications
- On hierarchies and communication
- The average tree solution for cycle-free graph games
- No-envy in queueing problems
- Strategic Information Transmission
- A Simple Expression for the Shapley Value in a Special Case
- Graphs and Cooperation in Games
- Authority and Communication in Organizations
- The Firm as a Communication Network
- Communication and Coordination in Social Networks