Component efficient solutions in line-graph games with applications
From MaRDI portal
Publication:2385112
DOI10.1007/s00199-006-0139-xzbMath1180.91040OpenAlexW2055108441MaRDI QIDQ2385112
Gerard van der Laan, René van den Brink, Valeri A. Vasil'ev
Publication date: 11 October 2007
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://research.vu.nl/en/publications/90f6e9c4-0ad9-431e-bc90-3513d4ada2a0
Related Items
Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ Values for games with two-level communication structures ⋮ The priority value for cooperative games with a priority structure ⋮ Polluted river problems and games with a permission structure ⋮ Incentives and justice for sequencing problems ⋮ Sharing a river with downstream externalities ⋮ The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations ⋮ Comments on: ``Recent developments in the queueing problem ⋮ Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: application to water resource systems ⋮ Axiomatic characterizations of the family of Weighted priority values ⋮ Balanced consistency and balanced cost reduction for sequencing problems ⋮ Sequential sharing rules for river sharing problems ⋮ Two-step values for games with two-level communication structure ⋮ The covering values for acyclic digraph games ⋮ Unnamed Item ⋮ On hierarchies and communication ⋮ Compensations in the Shapley value and the compensation solutions for graph games ⋮ Independence of downstream and upstream benefits in river water allocation problems ⋮ Sharing a river among satiable agents ⋮ Comparable characterizations of four solutions for permission tree games ⋮ The core of games on ordered structures and graphs ⋮ Harsanyi power solutions for graph-restricted games ⋮ The restricted core of games on distributive lattices: how to share benefits in a hierarchy ⋮ Minimum cost spanning tree problems with groups ⋮ Axiomatizations of two types of Shapley values for games on union closed systems ⋮ Tree, web and average web values for cycle-free directed graph games ⋮ 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 ⋮ Values for rooted-tree and sink-tree digraph games and sharing a river ⋮ Weighted component fairness for forest games ⋮ Allocating the costs of cleaning a river: expected responsibility versus median responsibility ⋮ Ensuring the boundedness of the core of games with restricted cooperation ⋮ THE RIVER SHARING PROBLEM: A SURVEY ⋮ Composition properties in the river claims problem
Cites Work
- The Shapley value of a patent licensing game: the asymptotic equivalence to non-cooperative results
- Characterizations of the random order values by Harsanyi payoff vectors
- Strong Tiebout equilibrium under restricted preferences domain
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Games with permission structures: The conjunctive approach
- Strongly balanced cooperative games
- Cooperative games with coalition structures
- An axiomatization of the disjunctive permission value for games with a permission structure
- An axiomatization of the Shapley value using a fairness property
- A characterization of the Shapley value in queueing problems
- Sharing a river.
- Axiomatizations of the conjunctive permission value for games with permission structures
- No-envy in queueing problems
- Cores of convex games
- Drop out monotonic rules for sequencing situations
- Cooperation in one machine scheduling
- Values of Graph-Restricted Games
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- Graphs and Cooperation in Games
- Sequencing and Cooperation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
