2004
DOI: 10.3386/w10506
|View full text |Cite
|
Sign up to set email alerts
|

Simple Estimators for the Parameters of Discrete Dynamic Games (with Entry/Exit Samples)

Abstract: This paper considers the problem of estimating the distribution of payoffs in a discrete dynamic game, focusing on models where the goal is to learn about the distribution of firms' entry and exit

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2005
2005
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 43 publications
(12 citation statements)
references
References 0 publications
0
12
0
Order By: Relevance
“…The objective may be a maximum likelihood function or pseudo-maximum likelihood function (see Mira 2002, 2007). Alternatively, it may be a (generalized) method-of-moments norm (see, e.g., Pakes et al 2007). The characterization of the equilibria p as the solutions to the FOC equations (29) helps, once again, enormously for any of these estimation methods: Traditional estimation methods, starting with Rust's (1987) (nested) fixed point algorithmic approach, have projected the associated optimization problems onto the parameter space , solving an optimization problem of the type min L p ∈ and p is an equilibrium under (45) This means that a search is conducted through the parameter space, and whenever a specific trial parameter vectorˆ ∈ is evaluated, all associated price equilibria p ˆ are computed.…”
Section: Structural Estimation Of the Game In Thementioning
confidence: 99%
“…The objective may be a maximum likelihood function or pseudo-maximum likelihood function (see Mira 2002, 2007). Alternatively, it may be a (generalized) method-of-moments norm (see, e.g., Pakes et al 2007). The characterization of the equilibria p as the solutions to the FOC equations (29) helps, once again, enormously for any of these estimation methods: Traditional estimation methods, starting with Rust's (1987) (nested) fixed point algorithmic approach, have projected the associated optimization problems onto the parameter space , solving an optimization problem of the type min L p ∈ and p is an equilibrium under (45) This means that a search is conducted through the parameter space, and whenever a specific trial parameter vectorˆ ∈ is evaluated, all associated price equilibria p ˆ are computed.…”
Section: Structural Estimation Of the Game In Thementioning
confidence: 99%
“…Consistent with this research agenda, we study the long-run industry equilibrium properties, in our case the spatial distribution of ships and exporters. Moreover, our empirical methodology borrows from the literature on the estimation of dynamic setups (e.g., Rust (1987), Bajari, Benkard, and Levin (2007), Pakes, Ostrovsky, and Berry (2007); applications include Ryan (2012) and Collard-Wexler (2013)). Buchholz (2019) and Frechette, Lizzeri, and Salz (2019) also explored dynamic decisions in the context of taxi cabs' search and shift choices, respectively.…”
Section: Related Literaturementioning
confidence: 99%
“…Our bootstrap sample is generated using the multinomial logit choice and transition probabilities for each player in each market in the same manner as a parametric bootstrap; cf. Kasahara and Shimotsu (2008) and Pakes, Ostrovsky, and Berry (2007). We use 500 bootstrap samples and report the standard errors in italics.…”
Section: Empirical Illustrationmentioning
confidence: 99%
“…Beside from explicitly separating out past actions from other observed state variables, MN(i) to MN(iii) are standard in the dynamic discrete choice game literature; for example, see Aguirregabiria and Mira (2007), Bajari, Benkard, and Levin (2007), Pakes, Ostrovsky, and Berry (2007), and Pesendorfer and Schmidt-Dengler (2008). MN(iv) extends N(i).…”
Section: A1 Identification Of the Switching Costs In Dynamic Gamesmentioning
confidence: 99%