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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...