서브메뉴
검색
Essays on Bandit Games and Endogenously Missing Data
Essays on Bandit Games and Endogenously Missing Data
Detailed Information
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211153129
- ISBN
- 9798346878674
- DDC
- 519.3
- 서명/저자
- Essays on Bandit Games and Endogenously Missing Data
- 발행사항
- [Sl] : Columbia University, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 162 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-06, Section: A.
- 주기사항
- Advisor: Tebaldi, Pietro.
- 학위논문주기
- Thesis (Ph.D.)--Columbia University, 2025.
- 초록/해제
- 요약I characterize optimal strategies and equilibria in two bandit-type games of strategic information acquisition. The latter game admits a missing data problem, which I develop an estimator to address. I consider a third environment with an additional missing data problem, characterize estimation bias both statistically and empirically, and develop a pair of easily implementable unbiased estimators. In the first chapter, I analyze a two-player, two-armed exponential bandit model in continuous time across several monitoring and disclosure environments, in which breakthroughs are fully informative of the state of the world. In particular, I consider an environment where player actions are observed but the results of experimentation are unobserved, and an environment where both actions and experimentation outcomes are unobserved. In the former environment, I construct a Perfect Bayesian Equilibrium that induces the efficient (cooperative) experimentation path. This equilibrium relies on strategies that deter free-riding by moving to an undesirable, asymmetric experimentation path when the safe arm is played. In the latter environment, I provide conditions on starting beliefs for which it is possible to construct a Perfect Bayesian Equilibrium that induces the efficient experimentation path. This equilibrium requires that players privately, separately experiment and share the results of experimentation at a single point in time. I show how this hybrid Markov approach can be adapted to a general discrete-time setting and provide conditions for which strategies measurable with respect to both the Markov partition and a finite automaton are consistent. In the second chapter, I consider the problem of a rideshare company which makes sequences of take it or leave it offers to drivers for individual trips. When drivers are privately and commonly informed of trip quality, rejected offers are informative about trip quality to the rideshare company. As such, the rideshare company faces a strategic information acquisition problem: offers influence both the current-period payoff and the expectation of future payoffs via posterior beliefs. When unobserved quality is Bernoulli, the value function increases in beliefs over quality, and I characterize the value function and optimal offer sequence using dynamic programming. Moreover, I show that a heuristic n-offer look-ahead sequence converges uniformly to the optimal revenue, and characterize bounds on the revenue gap. For a general bounded distribution of unobserved trip quality, I show that the value function is decreasing after rejections, and define analogous convergent bounds. Among heterogeneous drivers, driver and platform value can be collapsed into a single-dimensional match value parameter that governs the optimal order of offers. I also illustrate a source of potential bias when estimating driver preferences using a data set with repeated offers, and construct a consistent, easily-implementable estimator to address the issue. In the third chapter, I consider a choice environment where an econometrician only observes certain covariates for goods that are chosen. This missing data may reflect literal omissions from a dataset or inherently counterfactual outcomes, such as in the Roy (1951) model. When partially observed covariates vary stochastically across consumers there is selection bias in the distribution of observed covariates: consumers are more likely to pick goods with preferential characteristic draws. I show that imputation methods that use the observed distribution of covariates to replace missing data bias discrete choice parameter estimates toward zero, regardless of whether missing data or all data are imputed. Moreover, this bias rapidly increases with the variance of the covariate distribution. Instead, I propose two full-information maximum likelihood estimation procedures that jointly estimate preferences and the underlying distribution of covariates. While these estimators necessarily involve Monte Carlo simulation when covariates are distributed continuously, I show that it is possible to avoid simulation when covariates take a discrete set of values.
- 키워드
- Bandit games
- 키워드
- Missing data
- 키워드
- Rideshare
- 기타저자
- Columbia University Economics
- 기본자료저록
- Dissertations Abstracts International. 86-06A.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2025 us c eng d■001000017165144
■00520250211153129
■006m o d
■007cr#unu||||||||
■020 ▼a9798346878674
■035 ▼a(MiAaPQ)AAI31767313
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a519.3
■1001 ▼aGrimme, William James.
■24510▼aEssays on Bandit Games and Endogenously Missing Data
■260 ▼a[Sl]▼bColumbia University▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a162 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-06, Section: A.
■500 ▼aAdvisor: Tebaldi, Pietro.
■5021 ▼aThesis (Ph.D.)--Columbia University, 2025.
■520 ▼aI characterize optimal strategies and equilibria in two bandit-type games of strategic information acquisition. The latter game admits a missing data problem, which I develop an estimator to address. I consider a third environment with an additional missing data problem, characterize estimation bias both statistically and empirically, and develop a pair of easily implementable unbiased estimators. In the first chapter, I analyze a two-player, two-armed exponential bandit model in continuous time across several monitoring and disclosure environments, in which breakthroughs are fully informative of the state of the world. In particular, I consider an environment where player actions are observed but the results of experimentation are unobserved, and an environment where both actions and experimentation outcomes are unobserved. In the former environment, I construct a Perfect Bayesian Equilibrium that induces the efficient (cooperative) experimentation path. This equilibrium relies on strategies that deter free-riding by moving to an undesirable, asymmetric experimentation path when the safe arm is played. In the latter environment, I provide conditions on starting beliefs for which it is possible to construct a Perfect Bayesian Equilibrium that induces the efficient experimentation path. This equilibrium requires that players privately, separately experiment and share the results of experimentation at a single point in time. I show how this hybrid Markov approach can be adapted to a general discrete-time setting and provide conditions for which strategies measurable with respect to both the Markov partition and a finite automaton are consistent. In the second chapter, I consider the problem of a rideshare company which makes sequences of take it or leave it offers to drivers for individual trips. When drivers are privately and commonly informed of trip quality, rejected offers are informative about trip quality to the rideshare company. As such, the rideshare company faces a strategic information acquisition problem: offers influence both the current-period payoff and the expectation of future payoffs via posterior beliefs. When unobserved quality is Bernoulli, the value function increases in beliefs over quality, and I characterize the value function and optimal offer sequence using dynamic programming. Moreover, I show that a heuristic n-offer look-ahead sequence converges uniformly to the optimal revenue, and characterize bounds on the revenue gap. For a general bounded distribution of unobserved trip quality, I show that the value function is decreasing after rejections, and define analogous convergent bounds. Among heterogeneous drivers, driver and platform value can be collapsed into a single-dimensional match value parameter that governs the optimal order of offers. I also illustrate a source of potential bias when estimating driver preferences using a data set with repeated offers, and construct a consistent, easily-implementable estimator to address the issue. In the third chapter, I consider a choice environment where an econometrician only observes certain covariates for goods that are chosen. This missing data may reflect literal omissions from a dataset or inherently counterfactual outcomes, such as in the Roy (1951) model. When partially observed covariates vary stochastically across consumers there is selection bias in the distribution of observed covariates: consumers are more likely to pick goods with preferential characteristic draws. I show that imputation methods that use the observed distribution of covariates to replace missing data bias discrete choice parameter estimates toward zero, regardless of whether missing data or all data are imputed. Moreover, this bias rapidly increases with the variance of the covariate distribution. Instead, I propose two full-information maximum likelihood estimation procedures that jointly estimate preferences and the underlying distribution of covariates. While these estimators necessarily involve Monte Carlo simulation when covariates are distributed continuously, I show that it is possible to avoid simulation when covariates take a discrete set of values.
■590 ▼aSchool code: 0054.
■653 ▼aBandit games
■653 ▼aContinuous-time games
■653 ▼aDynamic programming
■653 ▼aMissing data
■653 ▼aRideshare
■690 ▼a0511
■690 ▼a0501
■71020▼aColumbia University▼bEconomics.
■7730 ▼tDissertations Abstracts International▼g86-06A.
■790 ▼a0054
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17165144▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
Подробнее информация.
- Бронирование
- не существует
- моя папка
- Первый запрос зрения
- Non-Book Loan Application
- Nighttime Book Loan Application
Available after logging in.


