Global Concavity and Optimization in a Class of Dynamic Discrete Choice Models
Yiding Feng, Ekaterina Khmelnitskaya, Denis Nekipelov
Abstract
Discrete choice models with unobserved heterogeneity are commonly used Econometric models for dynamic Economic behavior which have been adopted in practice to predict behavior of individuals and firms from schooling and job choices to strategic decisions in market competition. These models feature optimizing agents who choose among a finite set of options in a sequence of periods and receive choice-specific payoffs that depend on both variables that are observed by the agent and recorded in the data and variables that are only observed by the agent but not recorded in the data. Existing work in Econometrics assumes that optimizing agents are fully rational and requires finding a functional fixed point to find the optimal policy. We show that in an important class of discrete choice models the value function is globally concave in the policy. That means that simple algorithms that do not require fixed point computation, such as the policy gradient algorithm, globally converge to the optimal policy. This finding can both be used to relax behavioral assumption regarding the optimizing agents and to facilitate Econometric analysis of dynamic behavior. In particular, we demonstrate significant computational advantages in using a simple implementation policy gradient algorithm over existing "nested fixed point" algorithms used in Econometrics. © Author(s) 2020. All rights reserved.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- Inference from Auction PricesJason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe WangSODA 2020 · 1 citation
- Theoretical Guarantees of Fictitious Discount Algorithms for Episodic Reinforcement Learning and Global Convergence of Policy Gradient MethodsXin Guo, Anran Hu, Junzi ZhangAAAI 2022 · 10 citations
- Networked Digital Public Goods Games with Heterogeneous Players and Convex CostsYukun Cheng, Xiaotie Deng, Yunxuan MaWWW 2025 · 2 citations
- Learning in Stackelberg Mean Field Games: A Non-Asymptotic AnalysisSihan Zeng, Benjamin Patrick Evans, Sujay Bhatt, Leo Ardon et al.NeurIPS 2025 · 1 citation
- A Policy Gradient Method for Confounded POMDPsMao Hong, Zhengling Qi, Yanxun XuICLR 2024 · 5 citations
