Fair cost-sharing methods for the minimum spanning tree game

Eric Angel (1) , Evripidis Bampis (1) , Lélia Blin (1) , Laurent Gourvès (1)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

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 introduice 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 spannig tree game.

Domaines: Informatique; Recherche opérationnelle [math.OC]; Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]; Informatique et théorie des jeux [cs.GT]

Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès. Fair cost-sharing methods for the minimum spanning tree game. Information Processing Letters, 2006, 100, pp.29--35. ⟨10.1016/j.ipl.2006.05.007⟩. ⟨hal-00341341⟩