Gustavo Bergantiños
ABSTRACT
Tijs et al. (2006) introduce the family of obligation rules in minimum cost spanning tree problems. We prove that obligation rules are closely related with the marginalistic values of the irreducible game. We also provide axiomatic characterizations of obligation rules with two basic monotonicity properties, namely population monotonicity (if new agents join a "society" no agent from the "initial society" can be worse off) and strong cost monotonicity (if a number of connection costs increase, no agent can be better off). In this class, the folk rule is the only allocation rule satisfying equal treatment of equals.
Index Terms
- On obligation rules for minimum cost spanning tree problems
Recommendations
Characterizing rules in minimum cost spanning tree problems
A theorem of Bergantios and Vidal-Puga (2015) states that in minimum cost spanning tree problems a rule satisfies separability and reductionism if and only if it is induced by an extra-costs function. In this article, we point out that the positivity of ...
Merge-proofness in minimum cost spanning tree problems
AbstractIn the context of cost sharing in minimum cost spanning tree problems, we introduce a property called merge-proofness. This property says that no group of agents can be better off claiming to be a single node. We show that the sharing rule that ...
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and ComputationIn this paper we consider bi-criteria geometric optimization problems, in particular, the minimum diameter minimum cost spanning tree problem and the minimum radius minimum cost spanning tree problem for a set of points in the plane. The former problem ...
Comments