We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through … 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 …

We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through … 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 …

One-sided assignment problems combine important features of two well-known matching models. First, as in roommate … problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be … with a non-empty core), if a subsolution of the core satisfies [indifference with respect to dummy agents, continuity, and …

study of value theory and core theory. These two theories are the key to solving problems involving the allocation of goods …, such as the exploration of stable solutions for matching and exchange, the measurement of power and a deeper understanding …

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 …

This paper develops a framework for studying repeated matching markets. The model departs from the Gale …-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers …) in every period. I define history-dependent and self-enforcing matching processes in this repeated matching environment …

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 …

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 …