Showing 91 - 100 of 112
Persistent link: https://www.econbiz.de/10009149574
We consider the problem of allocating the income of museum pass programs. Various properties of an allocation rule for such problems are introduced. Two allocation rules are characterized and are shown to coincide with the Shapley value and the equal division solution of the associated tu-game...
Persistent link: https://www.econbiz.de/10008756104
We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to...
Persistent link: https://www.econbiz.de/10008682968
In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a...
Persistent link: https://www.econbiz.de/10008836403
We study values for transferable utility games enriched by a communication graph (CO-games) where the graph does not necessarily a¤ect the productivity but can in?uence the way the players distribute the worth generated by the grand coalition. Thus, we can envisage values that are efficient...
Persistent link: https://www.econbiz.de/10011183207
TU games with two-level communication structure, in which a two-level communication structure relates fundamentally to the given coalition structure and consists of a communication graph on the collection of the a priori unions in the coalition structure, as well as a collection of communication...
Persistent link: https://www.econbiz.de/10011183208
We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n−1.
Persistent link: https://www.econbiz.de/10011049836
For any transferable utility game in coalitional form with a nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is at most n-1, where n is the number of players. This bound exploits the geometry of the core and...
Persistent link: https://www.econbiz.de/10011108416
We introduce new axioms for the class of all TU-games with a fixed but arbitrary player set, which require either invariance of an allocation rule or invariance of the payoff assigned by an allocation rule to a specified subset of players in two related TU-games. Comparisons with other axioms...
Persistent link: https://www.econbiz.de/10011109081
We introduce the sequential equal surplus division for sharing the total welfare resulting form the cooperation of agents along a river with a delta. This allocation rule can be seen as a generalization of the contribution vectors introduced by Ju, Borm and Ruys (2007) in the context of...
Persistent link: https://www.econbiz.de/10011111841