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

The authors propose an Markov Chain Monte Carlo (MCMC) method for estimating a class of linear sum assignment problems (LSAP; the discrete case of the optimal transport problems). Prominent examples include multi-item auctions and mergers in industrial organizations. This contribution is to...

In this paper, I propose a one-step nondegenerate test as an alternative to the classical Vuong (1989) tests. I show that the new test achieves uniform asymptotic size control in both the overlapping and the non-overlapping cases, while the classical Vuong tests do not. Meanwhile, the power of...