Balancedness conditions for exact games

P. Csóka, P.J.J. Herings, L.Á. Kóczy

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

Abstract

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced. The condition of exact balancedness is identical to the one of balancedness, except that one of the balancing weights may be negative, while for overbalancedness one of the balancing weights is required to be non-positive and no weight is put on the grand coalition. Exact balancedness and overbalancedness are both easy to formulate conditions with a natural game-theoretic interpretation and are shown to be useful in applications. Using exact balancedness we show that exact games are convex for the grand coalition and we provide an alternative proof that the classes of convex and totally exact games coincide. We provide an example of a game that is totally balanced and convex for the grand coalition, but not exact. Finally we relate classes of balanced, totally balanced, convex for the grand coalition, exact, totally exact, and convex games to one another.

Original languageEnglish
Pages (from-to)41-52
Number of pages12
JournalMathematical Methods of Operations Research
Volume74
Issue number1
DOIs
Publication statusPublished - Aug 2011

Keywords

  • Totally balanced games
  • Exact games
  • Convex games
  • NONTRANSFERABLE UTILITY
  • CORE

Cite this