Recent Advances in Optimization pp 293-303
Some Characterizations of Convex Games
- Cite this paper as:
- Martínez-Legaz J.E. (2006) Some Characterizations of Convex Games. In: Seeger A. (eds) Recent Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 563. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.