Fair cost-sharing methods for the minimum spanning tree game - Archive ouverte HAL
Article Dans Une Revue Information Processing Letters Année : 2006

Fair cost-sharing methods for the minimum spanning tree game

Résumé

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.
Fichier principal
Vignette du fichier
abbg.pdf (251.77 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00341341 , version 1 (19-07-2009)

Identifiants

Citer

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⟩
187 Consultations
168 Téléchargements

Altmetric

Partager

More