This paper studies market clearing in matching markets. The model is non-cooperative, fully decentralized, and in Markov strategies. Workers and firms bargain with each other to determine who will be matched with whom and at what terms of trade. Once a worker-firm pair reach agreement, they exit...

We develop a theory of stability in many-to-many matching markets. We give conditions under which the setwise-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise-stable set coincides with the pairwise-stable set and...

We analyze the formation of partnerships in social networks. Players need favors at random times and ask their neighbors in the network to form exclusive long-term partnerships that guarantee reciprocal favor exchange. Refusing to provide a favor results in the automatic removal of the...

This paper studies an N-person war of attrition which needs one exit for its ending. An N-person war of attrition is qualitatively different from its two-person version. Only in the former, the set of players who are actively engaged in a war of attrition may change over time. We introduce the...

We study directed search equilibria in a decentralized market with adverse selection, where uninformed buyers post general trading mechanisms and informed sellers select one of them. We show that this has differing and significant implications with respect to the traditional approach, based on...

Increasingly, more school districts across the US are using centralized admissions for charter, magnet, and neighborhood schools in a common enrollment system. We first show that, across all school-participation patterns, full participation in the common (or unified) enrollment system leads to...

We generalize the school choice problem by defining a notion of allowable priority violations. In this setting, a weak axiom of stability (partial stability) allows only certain priority violations. We introduce a class of algorithms called the Student Exchange under Partial Fairness (SEPF)....

Various forms of substitutability are essential for establishing the existence of equilibria and other useful properties in diverse settings such as matching, auctions, and exchange economies with indivisible goods. We extend earlier models' definitions of substitutability to settings in which...

This paper studies a stability notion and matching processes in the job market with incomplete information on the workers' side. Each worker is associated with a type, and each firm cares about the type of her employee under a match. Moreover, firms' information structure is described by...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...