1. Convex games versus clan games
- Author
-
Dinko Dimitrov, Rodica Branzei, and Stef Tijs
- Subjects
Core , Dual games ,Total clan games ,Computer Science::Computer Science and Game Theory ,General Computer Science ,Spieltheorie ,Weber set, Core, Marginal games, Total clan games, Convex games, Dual games ,Monotonic function ,Kooperatives Spiel ,Set (abstract data type) ,C71 ,jel:C0 ,ddc:330 ,Quantitative Biology::Populations and Evolution ,Marginal games ,Clan ,Business and International Management ,jel:C6 ,jel:C7 ,Mathematics ,Discrete mathematics ,Convex games, core, dual games, marginal games, total clan games, Weber set, C71 ,Weber set ,Regular polygon ,ComputingMilieux_PERSONALCOMPUTING ,Dual games ,Quantitative Biology::Genomics ,Koalition ,Zero (linguistics) ,jel:M2 ,Core (game theory) ,restrict ,Core ,Statistics, Probability and Uncertainty ,jel:D5 ,Convex games ,jel:B4 ,jel:D7 - Abstract
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic convex game generates a total clan game with zero worth for the clan by a "dualize and extend" procedure. These procedures are also useful for relating core elements and elements of the Weber set of the corresponding games.
- Published
- 2006