We develop observable restrictions of well-known theories of bargaining over money. We suppose that we observe a finite data set of bargaining outcomes, including data on allocations and disagreement points, but no information on utility functions. We ask when a given theory could generate the...

We generalize the standard revealed preference exercise in economics, and prove a sufficient condition under which the revealed preference formulation of an economic theory has universal implications and when these implications can be recursively enumerated. We apply our theorem to two theories...

We investigate a normative theory of incomplete preferences in the context of preliminary screening procedures. We introduce a theory of ranking in the presence of objectively incomparable marginal contributions (apples and oranges). Our theory recommends benchmarking, a method under which an...

A planner wants to elicit information about an agent's preference relation, but not the entire ordering. Specifically, preferences are grouped into "types", and the planner only wants to elicit the agent's type. We first assume beliefs about randomization are subjective, and show that a space of...

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 present a theoretical explanation of inefficient early matching in matching markets. Our explanation is based on strategic complementarities and strategic unraveling. We identify a negative externality imposed on the rest of the market by agents who make early offers. As a consequence, an...

We experimentally study the Gale and Shapley, 1962 mechanism, which is utilized in a wide set of applications, most prominently the National Resident Matching Program (NRMP). Several insights come out of our analysis. First, only 48% of our observed outcomes are stable, and among those a large...

We investigate stochastic choice when only the average and not the entire distribution of choices is observable, focusing attention on the popular Luce model. Choice is pathindependent if it is recursive,in the sense that choosing from a menu can be broken up into choosing from smaller...

We study the degree of falsifiability of theories of choice. A theory is easy to falsify if relatively small datasets are enough to guarantee that the theory can be falsified: the VC dimension of a theory is the largest sample size for which the theory is ''never falsifiable.'' VC dimension is...

We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice. Aggregate matchings are relevant as matching...