Showing 1 - 10 of 31
This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective.It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core.If congestion costs are concave, then the corresponding game has not...
Persistent link: https://www.econbiz.de/10011092232
The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on a characterization of the T -value in...
Persistent link: https://www.econbiz.de/10011092926
In this paper we introduce three-valued simple games as a natural extension<br/>of simple games. While simple games are used to evaluate single voting systems, three-valued simple games offer the opportunity for a simultaneous analysis of two different voting systems within the same parliamentary...
Persistent link: https://www.econbiz.de/10011268490
In this paper we characterize the class of games for which the core coincides with the core cover (compromise stable games).Moreover we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems.Also the class of convex...
Persistent link: https://www.econbiz.de/10011090315
A generalization of processing problems with restricted capacities is introduced.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.The new aspect is that players have interest...
Persistent link: https://www.econbiz.de/10011090702
This paper analyzes processing problems and related cooperative games.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.There are no restrictions whatsoever on the processing...
Persistent link: https://www.econbiz.de/10011091197
This paper analyzes the compromise social choice correspondence derived from the F-value of digraph games.Among other things monotonicity of this correspondence is shown
Persistent link: https://www.econbiz.de/10011091273
In this paper we introduce a new family of compromise solutions for the class of compromise admissible games.These solutions extend bankruptcy rules.In particular, we show that the compromise extension of the run-to-the-bank rule coincides with the barycentre of the core cover and characterise...
Persistent link: https://www.econbiz.de/10011091711
This paper revisits the Alexia value, a recent solution concept for cooperative transferable utility games. We introduce the dual Alexia value and show that it coincides with the Alexia value for several classes of games. We demonstrate the importance of the notion of compromise stability for...
Persistent link: https://www.econbiz.de/10011092221
The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an order of the players and describes the efficient payoff vector giving the first players in the order their utopia demand as long as it is still possible...
Persistent link: https://www.econbiz.de/10011092639