Sharing the Cost of a Capacity Network
From MaRDI portal
Publication:3169088
DOI10.1287/moor.1090.0435zbMath1232.91063OpenAlexW1967587519WikidataQ111605386 ScholiaQ111605386MaRDI QIDQ3169088
Anna Bogomolnaia, Hervé Moulin, Ron Holzman
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1090.0435
Communication networks in operations research (90B18) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Cost allocation in asymmetric trees ⋮ Optimal cost sharing for capacitated facility location games ⋮ Routing-proofness in congestion-prone networks ⋮ Minimum cost arborescences ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Loss allocation in energy transmission networks ⋮ Pricing traffic in a spanning network ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Revenue Sharing in Airline Alliance Networks
This page was built for publication: Sharing the Cost of a Capacity Network
