135 research outputs found
Egalitarianism in Convex Fuzzy Games
In this paper the egalitarian solution for convex cooperative fuzzy games is introduced.The classical Dutta-Ray algorithm for finding the constrained egalitarian solution for convex crisp games is adjusted to provide the egalitarian solution of a convex fuzzy game.This adjusted algorithm is also a finite algorithm, because the convexity of a fuzzy game implies in each step the existence of a maximal element which corresponds to a crisp coalition.For arbitrary fuzzy games the equal division core is introduced.It turns out that both the equal division core and the egalitariansolution of a convex fuzzy game coincide with the corresponding equal division core and the constrained egalitarian solution, respectively, of the related crisp game.game theory
Egalitarianism in convex fuzzy games
In this paper the egalitarian solution for convex cooperative fuzzy games is introduced. The classical Dutta-Ray algorithm for finding the constrained egalitarian solution for convex crisp games is adjusted to provide the egalitarian solution of a convex fuzzy game. This adjusted algorithm is also a finite algorithm, because the convexity of a fuzzy game implies in each step the existence ∗This paper was written while the authors were research fellows at the ZiF (Bielefeld) for the project “Procedural Approaches to Conflict Resolution”, 2002. We thank our hosts for their hospitality
Egalitarianism in Multi-Choice Games
In this paper we introduce the equal division core for arbitrary multi-choice games and the constrained egalitarian solution for con- vex multi-choice games, using a multi-choice version of the Dutta-Ray algorithm for traditional convex games. These egalitarian solutions for multi-choice games have similar properties as their counterparts for traditional cooperative games. On the class of convex multi-choice games, we axiomatically characterize the constrained egalitarian solu- tion.Multi-choice games;Convex games;Equal division core;Constrained egalitarian solution
Convex games versus clan games
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.convex games, core, dual games, marginal games, total clan games, Weber set
Multi-Choice Total Clan Games: Characterizations and Solution Concepts
This paper deals with a new class of multi-choice games, the class of multi- choice total clan games. The structure of the core of a multi-choice clan game is explicitly described. Furthermore, characterizations of multi-choice total clan games are given and bi-monotonic allocation schemes related to players' levels are introduced for such games. It turns out that some elements in the core of a multi- choice total clan game are extendable to such bi-monotonic allocation schemes via suitable compensation-sharing rules on the domain of multi-choice (total) clan games.Multi-choice games;Clan games;Monotonic allocation schemes
Convex Games versus Clan Games
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.convex games;core;dual games;marginal games;total clan games;Weber set
Egalitarianism in Multi-Choice Games
In this paper we introduce the equal division core for arbitrary multi-choice games and the constrained egalitarian solution for con- vex multi-choice games, using a multi-choice version of the Dutta-Ray algorithm for traditional convex games. These egalitarian solutions for multi-choice games have similar properties as their counterparts for traditional cooperative games. On the class of convex multi-choice games, we axiomatically characterize the constrained egalitarian solu- tion
A Rawlsian View of CSR and the Game Theory of its Implementation (Part II): Fairness and Equilibrium
- …