Minimum cost spanning tree games and spillover stability
From MaRDI portal
Publication:1934274
DOI10.1007/s11238-011-9262-7zbMath1281.91045OpenAlexW2170001350MaRDI QIDQ1934274
Ruud Hendrickx, P. E. M. Borm, Jacco J. J. Thijssen
Publication date: 28 January 2013
Published in: Theory and Decision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11238-011-9262-7
Cooperative games (91A12) Games involving graphs (91A43) Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Sequencing games
- On the core of a traveling salesman cost allocation game
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Values of games in partition function form
- A theory of endogenous coalition structures
- Operations research games: A survey. (With comments and rejoinder)
- Sequential formation of coalitions in games with externalities and fixed payoff division
- Cores of convex games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- The Nucleolus of a Characteristic Function Game
This page was built for publication: Minimum cost spanning tree games and spillover stability