k -additive upper approximation of TU-games - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2020

k -additive upper approximation of TU-games

Résumé

We study the problem of an upper approximation of a TU-game by a-additive game under the constraint that both games yield the same Shapley value. The best approximation is obtained by minimizing the sum of excesses with respect to the original game, which yields an LP problem. We show that for any game with at most 4 players all vertices of the polyhedron of feasible solutions are optimal, and we give an explicit formula of the value of the LP problem for a particular class of games.
Fichier principal
Vignette du fichier
ORL-revised-May 2020.pdf (265.12 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-02860802 , version 1 (08-06-2020)

Identifiants

Citer

Michel Grabisch, Agnieszka Rusinowska. k -additive upper approximation of TU-games. Operations Research Letters, 2020, 48 (4), pp.487-492. ⟨10.1016/j.orl.2020.06.001⟩. ⟨halshs-02860802⟩
66 Consultations
212 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More