On the core of cost-revenue games: minimum cost spanning tree games with revenues
From MaRDI portal
Publication:2253991
DOI10.1016/j.ejor.2014.01.056zbMath1304.91043OpenAlexW3023195709MaRDI QIDQ2253991
Hans Reijnierse, Arantza Estévez-Fernández
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://papers.tinbergen.nl/12101.pdf
Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (2)
Sharing cost of network among users with differentiated willingness to pay ⋮ \textit{Folk} solution for simple minimum cost spanning tree problems
Cites Work
- New characterizations for largeness of the core
- On the core of routing games with revenues
- Communication and cooperation in public network situations
- The nucleolus of trees with revenues
- Cooperative games with large cores
- Traveling salesman games
- A further note on the nucleolus of the `airport game'
- On the core of routing games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Computing the nucleolus of some combinatorially-structured games.
- Spanning network games.
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- A simple algorithm for the nucleolus of airport profit games
- Cores of exact games. I
- On the core and nucleolus of minimum cost spanning tree games
- Minimum cost spanning tree games
- Cost allocation for a spanning tree
- Lewis Carroll and the Enumeration of Minimal Covers
This page was built for publication: On the core of cost-revenue games: minimum cost spanning tree games with revenues
