Convex and exact games with non-transferable utility

Peter Csoka*, P.J.J. Herings, Laszlo A. Koczy, Miklos Pinter

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

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 Pi-balanced, totally Pi-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another. 

Original languageEnglish
Pages (from-to)57-62
JournalEuropean Journal of Operational Research
Volume209
Issue number1
DOIs
Publication statusPublished - Feb 2011
Externally publishedYes

Keywords

  • NTU games
  • Exact games
  • Convex games
  • CORES

Fingerprint

Dive into the research topics of 'Convex and exact games with non-transferable utility'. Together they form a unique fingerprint.

Cite this