Showing 1 - 10 of 17
An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core … if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the … union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on …
Persistent link: https://www.econbiz.de/10009493567
An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core … if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the … union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on …
Persistent link: https://www.econbiz.de/10010611661
generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a … bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core … for sets belonging to so-called normal collections, resulting (if nonempty) in the selection of a bounded face of the core …
Persistent link: https://www.econbiz.de/10010585720
generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a … bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core … for sets belonging to so-called normal collections, resulting (if nonempty) in the selection of a bounded face of the core …
Persistent link: https://www.econbiz.de/10010585897
A Chinese postman (CP) game is induced by a a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this...
Persistent link: https://www.econbiz.de/10013088117
This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...
Persistent link: https://www.econbiz.de/10013088121
nonempty core. However, a six player MLTS game may have an empty core. For the special instance where the reward between a pair … of nodes is equal to 0 or 1, we provide relations between the structure of the core and the underlying network …
Persistent link: https://www.econbiz.de/10014071143
We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence … constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under … generalized Davis-Maschler reduced games, and the possibility of nondiscrimination. The bounded positive core, i.e., the union of …
Persistent link: https://www.econbiz.de/10010791268
We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence … constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under … generalized Davis-Maschler reduced games, and the possibility of nondiscrimination. The bounded positive core, i.e., the union of …
Persistent link: https://www.econbiz.de/10010818963
distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core …, which is the union of all bounded faces of the core, proves to be a useful solution concept in the framework of games with … precedence constraints. Replacing the inequalities that define the core by equations for a collection of coalitions results in a …
Persistent link: https://www.econbiz.de/10010775866