In this paper, we analyze a discrete choice model for partially ordered alternatives. The alternatives are differentiated along two dimensions: the first an unordered 'horizontal' dimension, and the second an ordered 'vertical' dimension. The model can be used in circumstances in which...

We provide a finite sample inference method for the structural parameters of a semiparametric binary response model under a conditional median restriction originally studied by Manski (1975, 1985). Our inference method is valid for any sample size and irrespective of whether the structural...

We study inference in complete information games with discrete strategy spaces. Unlike binary games, we allow for rich strategy spaces and we only assume that they are ordinal in nature. We derive observable implications of equilibrium play under mild shape restrictions on payoff functions, and...

In this paper we analyze a discrete choice model for partially ordered alternatives. The alternatives are differentiated along two dimensions, the first an unordered "horizontal" dimension, and the second an ordered "vertical" dimension. The model can be used in circumstances in which...

We study inference in complete information games with discrete strategy spaces. Unlike binary games, we allow for rich strategy spaces and we only assume that they are ordinal in nature. We derive observable implications of equilibrium play under mild shape restrictions on payoff functions, and...

We study econometric models of complete information games with ordered action spaces, such as the number of store fronts operated in a market by a firm, or the daily number of flights on a city-pair offered by an airline. The model generalizes single agent models such as ordered probit and logit...

This paper proposes a new way to construct confidence sets for a parameter of interest in models comprised of finitely many moment inequalities. Building on results from the literature on multivariate one-sided tests, I show how to test the hypothesis that any particular parameter value is...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

In this paper we analyze a discrete choice model for partially ordered alternatives. The alternatives are differentiated along two dimensions, the first an unordered "horizontal" dimension, and the second an ordered "vertical" dimension. The model can be used in circumstances in which...