Skip to Main content Skip to Navigation
Journal articles

k -additive upper approximation of TU-games

Abstract : 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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Michel Grabisch <>
Submitted on : Monday, June 8, 2020 - 3:56:13 PM
Last modification on : Tuesday, January 19, 2021 - 11:08:38 AM


ORL-revised-May 2020.pdf
Files produced by the author(s)




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



Record views


Files downloads