We propose using cyclic monotonicity, a convex-analytic property of the random utility choice model, to derive bounds on counterfactual choice probabilities in semiparametric multinomial choice models. These bounds are useful for typical counterfactual exercises in aggregate discrete-choice...

We show how to construct bounds on counterfactual choice probabilities in semiparametric discrete-choice models. Our procedure is based on cyclic monotonicity, a convex-analytic property of the random utility discrete-choice model. These bounds are useful for typical counterfactual exercises in...

Using data from "WebsiteX", one of the largest online marketplaces in the world, we estimate a structural model of sponsored search auctions where bidders have heterogeneous click-through curves. Unlike earlier studies, our model accommodates two stylized empirical facts: the advertiser...

We propose an inference procedure for estimators defined by mathematical programming problems, focusing on the important special cases of linear programming (LP) and quadratic programming (QP). In these settings, the coefficients in both the objective function and the constraints of the...

The problem of demand inversion -- a crucial step in the estimation of randomutility discrete-choice models -- is equivalent to the determination of stable outcomes intwo-sided matching models. This equivalence applies to random utility models that are notnecessarily additive, smooth, nor even...