Showing 1 - 10 of 3,070
Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class...
Persistent link: https://www.econbiz.de/10011090844
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 p4 for...
Persistent link: https://www.econbiz.de/10011090443
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...
Persistent link: https://www.econbiz.de/10011090670
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...
Persistent link: https://www.econbiz.de/10011092012
Persistent link: https://www.econbiz.de/10011089172
Persistent link: https://www.econbiz.de/10011090291
We introduce the class of Obligation rules for minimum cost spanning tree situations.The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes.Another characteristic of Obligation rules is that they assign to a minimum cost...
Persistent link: https://www.econbiz.de/10011090299
Under some weakenings of the condition of the well-known fixed point theorems of Brouwer, Kakutani and Banach the existence of approximate fixed points turns out to be still guaranteed. Also an approximate fixed point theorem is given for certain nonexpansive maps.
Persistent link: https://www.econbiz.de/10011090445
AMS classification: 91A12
Persistent link: https://www.econbiz.de/10011090477
In this paper reasonable payoff intervals for players in a game in partition function form (p.f.f.game) are introduced and used to define the notion of compromisable p.f.f. game.For a compromisable p.f.f. game a compromise value is defined for which an axiomatic characterization is provided.Also...
Persistent link: https://www.econbiz.de/10011090485