Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms

DOI10.1016/j.ejor.2009.04.003zbMath1180.91146OpenAlexW1992983112MaRDI QIDQ1038341

Gustavo Bergantiños, Juan J. Vidal-Puga

Publication date: 17 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.04.003

zbMATH Keywords

implementationminimum cost spanning tree problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Cooperative games (91A12) Games involving graphs (91A43) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Cost allocation in asymmetric trees ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Applying the Shapley value to the tuna fishery ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ Strategic sharing of a costly network ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers ⋮ Minimum cost spanning tree problems with groups ⋮ Smooth multibidding mechanisms ⋮ A new rule for source connection problems ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Axiomatization of the Shapley value on minimum cost spanning tree games
• A non-cooperative approach to the cost spanning tree problem.
• Cost monotonicity, consistency and minimum cost spanning tree games
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Additivity in minimum cost spanning tree problems
• Implementing cooperative solution concepts: a generalized bidding approach
• An implementation of the Owen value.
• Subscription mechanisms for network formation.
• The optimistic \(TU\) game in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• Bidding for surplus in network allocation problems
• The \(P\)-value for cost sharing in minimum
• Noncooperative cost spanning tree games with budget restrictions
• On cost allocation for a spanning tree: A game theoretic approach
• Two-Person Cooperative Games
• Bidding for the surplus: a non-cooperative approach to the Shapley value

This page was built for publication: Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms