Showing 61 - 70 of 25,315
We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual …
Persistent link: https://www.econbiz.de/10013098363
We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual …
Persistent link: https://www.econbiz.de/10013080181
uses the fact that the core of an associated compensation matching game with constraints is nonempty. …In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by … matching to a matching of maximum total reward, one can always provide a compensation schedule that will be ex-post stable in …
Persistent link: https://www.econbiz.de/10010373726
We provide a new proof of the non-emptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their "balanced cover games", which are non-empty, can be...
Persistent link: https://www.econbiz.de/10011380988
stable solutions of a multiple partners matching game in two different ways and perform a study on the core of the …We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph … the existence of a stable solution and the non-emptiness of the core, which holds in the other models with payments, is no …
Persistent link: https://www.econbiz.de/10011444411
of the extended cores of all μ-compatible subgames, for a given optimal matching μ, is the core with …In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in …-Morgenstern stable sets. The dominant diagonal property is necessary for the core to be a stable set, and also sufficient in the case …
Persistent link: https://www.econbiz.de/10012290253
characterize the existence of stable assignments in many-to-one matching problems with externalities. The set of stable matchings … bottom q-substitutability that guarantees the existence of at least one stable matching when the set of estimations includes … all possible matches. Finally, we analyze a notion of the core and its relation with the set of stable assignments. …
Persistent link: https://www.econbiz.de/10012616396
coalition forms without delay in equilibrium, expected payoffs must be in the core of the characteristic function game that …
Persistent link: https://www.econbiz.de/10012705280
models of bargaining, to cooperative game-theoretic notions of the core, or notions of coalition-proofness in noncooperative …
Persistent link: https://www.econbiz.de/10010420285
Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no … 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