Fair cost-sharing methods for the minimum spanning tree game

We study the problem of sharing in a fair manner the cost of a service provided to a set of players in the context of Cooperative Game Theory. We introduce a new fairness measure capturing the dissatisfaction (or happiness) of each player and we propose two cost sharing methods minimizing the maximum or average dissatisfaction of the clients for the classical minimum spanning tree game.

[1]  Gustavo Bergantiños,et al.  A fair rule in minimum cost spanning tree problems , 2007, J. Econ. Theory.

[2]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[3]  Daniel J. Kleitman,et al.  Cost allocation for a spanning tree , 1973, Networks.

[4]  C. G. Bird,et al.  On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[5]  Yuval Rabani,et al.  Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[6]  Daniel Granot,et al.  Minimum cost spanning tree games , 1981, Math. Program..

[7]  Shigeo Muto,et al.  Bird's tree allocations revisited , 2000 .

[8]  Harold N. Gabow,et al.  Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..

[9]  Imma Curiel,et al.  Cooperative game theory and applications , 1997 .