Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...

We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through wage offers and wage demands, firms compete over workers and workers compete over jobs. Firms make hire-and-fire decisions dependent on the wages of their own workers and on the...

We develop a model of assignment games with pairwise-identitydependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

The paper considers a one-to-one matching with contracts model in the presence of price controls. This set-up contains two important streams in the matching literature, those with and those without monetary transfers, as special cases and allows for intermediate cases with some restrictions on...

We show that, given two matchings of which say the second is stable, if (a) no firm prefers the first matching to the second, and (b) no firm and the worker it is paired with under the second matching prefer each other to their respective assignments in the first matching, then no worker prefers...

It is known that in two-sided many-to-many matching markets, pair-wise stability is not logically related with the (weak) core, unlike in many-to-one matching markets (Blair, 1988). In this paper, we seek a theoretical foundation for pairwise stability when group deviations are allowed. Group...

We show that a simple generalisation of the Deferred Acceptance Procedure with men proposing due to Gale and Shapley (1962) yields outcomes for a generalised marriage problem, which are necessarily stable. We also show that any outcome of this procedure is Weakly Pareto Optimal for Men, i.e....

We show that, given two matchings for a room-mates problem of which say the second is stable, and given a non-empty subset of agents S if (a) no agent in S prefers the first matching to the second, and (b) no agent in S and his room-mate in S under the second matching prefer each other to their...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...