Showing 1 - 10 of 52
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/10011090291
AMS classification: 91A12
Persistent link: https://www.econbiz.de/10011090477
Market entry situations are modelled, where an entrepreneur has to decide for a collection of markets which market to enter and which not. The entrepreneur can improve his prior information by making use of a group of informants, each of them knowing the situation in one or more markets. For...
Persistent link: https://www.econbiz.de/10011090705
A class of cooperative games is introduced which arises from situations in which a set of agents is hierarchically structured and where potential individual economic abilities interfere with the behavioristic rules induced by the organization structure.These games form a cone generated by a...
Persistent link: https://www.econbiz.de/10011090722
We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy-free allocations in economies with indivisible objects, quasi-linear utility functions, and an amount of money.
Persistent link: https://www.econbiz.de/10011090747
AMS classification: 90D12; 03E72;
Persistent link: https://www.econbiz.de/10011090798
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