Consistency, population solidarity, and egalitarian solutions for TU-games

Consistency, population solidarity, and egalitarian solutions for TU-games

0.00 Avg rating0 Votes
Article ID: iaor20163729
Volume: 81
Issue: 3
Start Page Number: 427
End Page Number: 447
Publication Date: Sep 2016
Journal: Theory and Decision
Authors: , , ,
Keywords: game theory, programming: convex, simulation
Abstract:

A (point‐valued) solution for cooperative games with transferable utility, or simply TU‐games, assigns a payoff vector to every TU‐game. In this paper we discuss two classes of equal surplus sharing solutions. The first class consists of all convex combinations of the equal division solution (which allocates the worth of the ‘grand coalition’ consisting of all players equally over all players) and the center‐of‐gravity of the imputation‐set value (which first assigns every player its singleton worth and then allocates the remainder of the worth of the grand coalition, N, equally over all players). The second class is the dual class consisting of all convex combinations of the equal division solution and the egalitarian non‐separable contribution value (which first assigns every player its contribution to the ‘grand coalition’ and then allocates the remainder equally over all players). We provide characterizations of the two classes of solutions using either population solidarity or a reduced game consistency in addition to other standard properties.

Reviews

Required fields are marked *. Your email address will not be published.