k -additive upper approximation of TU-games
Michel Grabisch and
Agnieszka Rusinowska ()
Additional contact information
Agnieszka Rusinowska: CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL
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.
New Economics Papers: this item is included in nep-gth
Note: View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-02860802
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Published in Operations Research Letters, Elsevier, 2020, 48 (4), pp.487-492. ⟨10.1016/j.orl.2020.06.001⟩
Downloads: (external link)
Working Paper: k -additive upper approximation of TU-games (2020)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:hal:cesptp:halshs-02860802
Access Statistics for this paper
More papers in Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL
Bibliographic data for series maintained by CCSD ().