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 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 generalises single agent models such as ordered probit and logit...

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. We show that...

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

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