Some Characterizations of Convex Games

Purchase on

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access


Several characterizations of convexity for totally balanced games are presented. As a preliminary result, it is first shown that the core of any subgame of a nonnegative totally balanced game can be easily obtained from the maximum average value (MAV) function of the game. This result is then used to get a characterization of convex games in terms of MAV functions. It is also proved that a game is convex if and only if all of its marginal games are totally balanced.