Fair cost-sharing methods for the minimum spanning tree game |
| |
Authors: | Eric Angel,Evripidis Bampis,Laurent Gourvè s |
| |
Affiliation: | IBISC, FRE CNRS 2873, Université d'Évry, Tour Évry 2, 523 Place des terrasses de l'agora, 91000 Évry cedex, France |
| |
Abstract: | 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. |
| |
Keywords: | Cost sharing Fairness Minimum cost spanning tree game Bird rule Graph algorithms |
本文献已被 ScienceDirect 等数据库收录! |