Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480942 | European Journal of Operational Research | 2011 | 6 Pages |
Abstract
We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set.Convex games with transferable utility are well-known to be exact. We consider five generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be unified under NTU exactness. We provide an example of a cardinally convex game which is not NTU exact.Finally, we relate the classes of Π-balanced, totally Π-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Péter Csóka, P. Jean-Jacques Herings, László Á. Kóczy, Miklós Pintér,