We consider preference relations over information that are monotone: more information is preferred to less. We prove that, if a preference relation on information about an uncountable set of states of nature is monotone, then it is not representable by a utility function

We present a simple example where the use of sigma-algebras as a model of information leads to a paradoxical conclusion: a decision maker prefers less information to more. We then explain that the problem arises because the use of sigma-algebras as the informational content of a signal is...

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

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

I prove that, in models with complementarities, some non-monotone comparative statics must select unstable equilibria; and, under additional regularity conditions, that monotone comparative statics selects stable equilibria

Some results in the monotone comparative statics literature tell us that if a parameter increases, some old equilibria are smaller than some new equilibria. We give a sufficient condition such that at a new parameter value every old equilibrium is smaller than every new equilibrium. We also...

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 characterize the core many-to-one matchings as fixed points of a map. Our characterization gives an algorithm for finding core allocations; the algorithm is efficient and simple to implement. Our characterization does not require substitutable preferences, so it is separate from the structure...

We investigate the testable implications of the theory of stable matchings. We provide a characterization of the data that are rationalizable as a stable matching when agents' preferences are unobserved. The characterization is a simple nonparametric test for stability, in the tradition of...