Convex and exact games with non-transferable utility

Convex and exact games with non-transferable utility

0.00 Avg rating0 Votes
Article ID: iaor20108320
Volume: 209
Issue: 1
Start Page Number: 57
End Page Number: 62
Publication Date: Feb 2011
Journal: European Journal of Operational Research
Authors: , , ,
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.

Reviews

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