This paper provides a critical review of the methods for estimating static discrete games and their relevance for quantitative marketing. We discuss the various modeling approaches, alternative assumptions, and relevant trade-offs involved in taking these empirical methods to data. We consider...

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 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 provides a new point identification and estimation for two-player entry games with complete information under a symmetric condition on unobservables. Neither equilibrium selection nor distributional assumption is required. In addition, a weaker support condition is used in comparison...

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 some Bayesian games, payoff-relevant states are influenced by unobserved heterogeneity that also directly affects strategic decisions. When ignored, such endogeneity leads to erroneous parameter inference and policy implications. We introduce a control-function approach for estimating such...

In various economic environments, people observe other people with whom they strategically interact. We can model such information‐sharing relations as an information network, and the strategic interactions as a game on the network. When any two agents in the network are connected either...

Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...

This paper develops a strategy for identification and estimation of complete information games that does not require a regressor that has large support or a parametric specification for the distribution of the unobservables. The identification result uses a nonstandard but plausible condition on...

Counterfactual policy evaluation often requires computation of game-theoretic equilibria. We provide new algorithms for computing pure-strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that a...