Showing 541 - 547 of 547
We introduce several new solution concepts for cooperative games with arbitrary coalition structure. Of our main interest are coalitions structures being so-called building sets. A collection of sets is a building set if every singleton is a member and if the union of any two non-disjoint sets...
Persistent link: https://www.econbiz.de/10013128950
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure...
Persistent link: https://www.econbiz.de/10012723213
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure...
Persistent link: https://www.econbiz.de/10012723255
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {+/-1,+/-2,...,+/-n} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10012726145
A cooperative game with non-transferable utility (NTU-game) consists of a collection of payoff sets for the subsets of a finite set of players, for which it has to be determined how much payoff each player must receive. The core of an NTU-game consists of all payoff vectors that are in the...
Persistent link: https://www.econbiz.de/10013044184
In this paper three sufficient conditions are provided under each of which an upper semi-continuous point-to-set mapping defined on an arbitrary polytope has a connected set of zero points that connect two distinct faces of the polytope. Furthermore, we obtain an existence theorem of a connected...
Persistent link: https://www.econbiz.de/10014173484
Let X be a non-empty, compact, convex set in R and o an upper semi-continuous mapping from X to the collection of non-empty, compact, convex subsets of R;. It is well known that such a mapping has a stationary point on X, i.e. there exists a point in X satisfying that its image under o has a...
Persistent link: https://www.econbiz.de/10014091288