Showing 1 - 10 of 48
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
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve the cost sharing problem in minimum cost spanning tree (mcst) situations.The P-value is related to the Kruskal algorithm for finding an mcst.Moreover, the P-value leads to a core allocation of the...
Persistent link: https://www.econbiz.de/10011090677
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
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