Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Tijs, R. Branzei, Stefano Moretti, H. Norde (2004)
Obligation Rules for Minimum Cost Spanning Tree Situations and Their Monotonicity PropertiesManagement Practice
(2012)
A new stable and more responsible cost sharing solution for mcst problems
(1965)
On the shortest arborescence of a directed graph
Recall that F * i (A * ) is the set of followers of i under the mca A *
Eric Bahel, Christian Trudeau (2014)
Stable lexicographic rules for shortest path gamesEconomics Letters, 125
V. Feltkamp, S. Tijs, S. Muto (1994)
On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problemsResearch Papers in Economics
Christian Trudeau (2013)
Characterizations of the Kar and Folk solutions for Minimum Cost Spanning Tree ProblemsIGTR, 15
G. Bergantiños, Anirban Kar (2010)
On obligation rules for minimum cost spanning tree problemsGames Econ. Behav., 69
Bhaskar Dutta, D. Mishra (2012)
Minimum cost arborescencesGames Econ. Behav., 74
(1967)
Optimum branchings
G. Bergantiños, J. Vidal-Puga (2007)
A fair rule in minimum cost spanning tree problemsJ. Econ. Theory, 137
S Tijs, R Branzei, S Moretti, H Norde (2006)
Obligation rules for minimum cost spanning tree situations and their monotonicity propertiesEur J Oper Res, 175
Eric Bahel (2016)
On the core and bargaining set of a veto gameInternational Journal of Game Theory, 45
Observe thatc =ĉ + i∈N α i [s * (i)i] is the matrix obtained fromĉ by increasing the cost of the cheapest connection to every i ∈ N , from zero the the second-minimum cost to i
(2010)
Sharing the cost of aminimal cost spanning tree : beyond the folk solution
G. Bergantiños, J. Vidal-Puga (2009)
Additivity in minimum cost spanning tree problemsJournal of Mathematical Economics, 45
V Feltkamp, S Tijs, S Muto (1994)
On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. Technical report 106, CentER DP 1994 nr.106
C. Bird (1976)
On cost allocation for a spanning tree: A game theoretic approachNetworks, 6
The paper examines minimum cost arborescence (mca) problems, which generalize the well-known minimum cost spanning tree (mcst) problems by allowing the cost to depend on the direction of the flow. We propose a new family of cost sharing methods that are easy to compute, as they closely relate to the network-building algorithm. These methods are called minimum incoming cost rules for arborescences (MICRAs). They include as a particular case the extension of the folk solution introduced by Dutta and Mishra [Games Econ Behav 74(1):120–143, 2012], providing a simple procedure for its computation. We also provide new axiomatizations of (a) the set of stable and symmetric MICRAs and (b) the Dutta–Mishra solution. Finally, we closely examine two MICRAs that (unlike the Dutta–Mishra rule) compensate agents who help others connect at a lower cost. The first of these two rules relates to the cycle-complete solution for mcst problems introduced by Trudeau [Games Econ Behav 75(1):402–412, 2012].
Social Choice and Welfare – Springer Journals
Published: May 31, 2017
Access the full text.
Sign up today, get DeepDyve free for 14 days.