Trouble comes in threes: core stability in minimum cost connection networks

DOI10.1016/j.ejor.2021.05.044zbMath1487.91018OpenAlexW3169740440MaRDI QIDQ2242222

Jens Leth Hougaard, Mich Tvede

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://okonomi.foi.dk/workingpapers/WPpdf/WP2020/IFRO_WP_2020_07.pdf

zbMATH Keywords

game theoryspanning treecost sharingfair allocationminimum cost connection network

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Cost allocation in asymmetric trees
• Implementing efficient graphs in connection networks
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Decentralized pricing in minimum cost spanning trees
• A non-cooperative approach to the cost spanning tree problem.
• On the core of network synthesis games
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Minimum cost connection networks: truth-telling and implementation
• The minimum cost spanning forest game
• Sharing a minimal cost spanning tree: beyond the folk solution
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• Social enterprise tree network games
• Approximation and collusion in multicast cost sharing
• Truth-telling and Nash equilibria in minimum cost spanning tree models
• Pricing traffic in a spanning network
• The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• A fair rule in minimum cost spanning tree problems
• CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
• Designing Network Protocols for Good Equilibria
• Sharing the Cost of a Capacity Network
• The Price of Stability for Network Design with Fair Cost Allocation
• 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
• Reducibility among Combinatorial Problems
• Introduction to the Theory of Cooperative Games
• Combinatorial optimization. Theory and algorithms
• Sharing the cost of multicast transmissions

This page was built for publication: Trouble comes in threes: core stability in minimum cost connection networks