Showing 1 - 10 of 1,091
general conditions. They imply that any efficient profile that is approximately achievable must be in the core of the …) an efficient profile can be approximately achieved if and only if it is in the core; and (iii) any achievable profile can …
Persistent link: https://www.econbiz.de/10011599486
outside players play their best response noncooperatively, the core is always nonempty when the game has strategic …
Persistent link: https://www.econbiz.de/10011608773
ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it lies in … the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove … that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the …
Persistent link: https://www.econbiz.de/10010324576
Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused,...
Persistent link: https://www.econbiz.de/10014496126
-298) is proposed to allow for multiple membership. The definition of the core is adapted analogously and the possibilities for …
Persistent link: https://www.econbiz.de/10011709835
are currently employed/unemployed. We show that such a process is absorbed into the core with probability one in finite … time. Moreover, within the core, allocations are selected that are characterized by surplus splitting according to a …
Persistent link: https://www.econbiz.de/10011709879
sell-side). This simple and intuitive learning process implements core allocations even though agents have no knowledge of …
Persistent link: https://www.econbiz.de/10010313218
scale such games are quite tractable in analysis, computation, and realization. A core imputation comes in terms of …
Persistent link: https://www.econbiz.de/10010315993
core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same … core structure. We then associate a system of linear inequalities with each equivalence class, and we show that the system … of TU games on which the core correspondence is additive (even linear). For the case of convex games we prove that the …
Persistent link: https://www.econbiz.de/10010281187
This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of … core of the combined game coincides with the sum of the cores of its components. On the other hand, for non-balanced games …, the binary relation associating two component games whose combination has an empty core is not transitive. However, we …
Persistent link: https://www.econbiz.de/10010284063