Neighbour Games and the Leximax Solution
نویسندگان
چکیده
Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbour games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component additive games (Curiel et al. (1994)). We first present some elementary features of neighbour games. After that we provide a polynomially bounded algorithm of order p for calculating the leximax solution (cf. Arin and Iñarra (1997)) of neighbour games, where p is the number of players.
منابع مشابه
Neighbor games and the leximax solution
Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component additive games (Curiel et al. (1994)). We first present some elementary features of neighbor games. Af...
متن کاملCooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملOn the Extreme Points of the Core of Neighbour Games and Assignment Games
Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of assignment games and the class of line graph restricted games yields the class of neighbour games. Further, w...
متن کاملOn the Nucleolus of Neighbour Games
The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bou...
متن کاملOn the equivalence of the two existing extensions of the leximax criterion to the infinite case
Using a common framework, we consider the two existing extensions of the leximax criterion to infinite environments [Arlegi, R., Besada, M., Nieto, J., Vázquez, C., 2005. Freedom of choice: the leximax criterion in the infinite case. Mathematical Social Sciences 49, 1–15; Ballester, M., De Miguel, J.R., 2003. Extending an order to the power set: the leximax criterion. Social Choice and Welfare ...
متن کامل