Pricing traffic in a spanning network
From MaRDI portal
Publication:2016252
DOI10.1016/j.geb.2013.06.002zbMath1294.91037OpenAlexW4230237005MaRDI QIDQ2016252
Publication date: 19 June 2014
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2013.06.002
Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Traffic problems in operations research (90B20)
Related Items
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ One-way and two-way cost allocation in hub network problems ⋮ Highway toll pricing ⋮ Routing-proofness in congestion-prone networks ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ On how to allocate the fixed cost of transport systems ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Free intermediation in resource transmission
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cost monotonicity, consistency and minimum cost spanning tree games
- On the core of network synthesis games
- Strong equilibrium in cost sharing connection games
- Sharing a minimal cost spanning tree: beyond the folk solution
- On weighted Shapley values
- Population monotonic allocation schemes for cooperative games with transferable utility
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Strategic cooperation in cost sharing games
- Spanning network games.
- A fair rule in minimum cost spanning tree problems
- Sharing the Cost of a Capacity Network
- On the core and nucleolus of minimum cost spanning tree games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Algorithmic Game Theory
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: Pricing traffic in a spanning network