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...

(less than 25 lines) I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a non-empty, complete lattice. For this purpose I introduce a device that allows the study of the set of...

This paper develops a measure of segregation based on two premises: (1) a measure of segregation should disaggregate to the level of individuals, and (2) an individual is more segregated the more segregated are the agents with whom she interacts. Developing three desirable axioms that any...

The literature on games of strategic complementarities (GSC) has focused on pure strategies. I introduce mixed strategies and show that, when strategy spaces are one-dimensional, the complementarities framework extends to mixed strategies ordered by first-order stochastic dominance. In...

I characterize games for which there is an order on strategies such that the game has strategic complementarities. I prove that, with some qualifications, games with a unique equilibrium have complementarities if and only if Cournot best-response dynamics has no cycles; and that all games with...

Changes in the parameters of an $n$-dimensional system of equations induce changes in its solutions. For a class of such systems, we determine the qualitative change in solutions given certain qualitative changes in parameters. Our methods and results are elementary yet useful. They highlight...

I give short and constructive proofs of Tarski's fixed-point theorem, and of a much-used extension of Tarski's fixed-point theorem to set- valued maps.

I count the number of combinatorial choice rules that satisfy certain properties: Kelso-Crawford substitutability, and independence of irrelevant alternatives. The results are important for two-sided matching theory, where agents are modeled by combinatorial choice rules with these properties....

We study many-to-one matchings, such as the assignment of students to colleges, where the students have preferences over the other students who would attend the same college. It is well known that the core of this model may be empty, without strong assumptions on agents' preferences. We...