Bandit Problems under Censored Feedback
In this thesis, we study sequential decision-making models where the feedback received by the principal depends on strategic uncertainty (e.g., agents’ willingness to follow a recommendation) and/or random uncertainty (e.g., loss or delay in arrival of information). Such challenges often arise in AI...
Main Author: | Guinet, Gauthier Marc Benoit |
---|---|
Other Authors: | Amin, Saurabh |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2023
|
Online Access: | https://hdl.handle.net/1721.1/147326 |
Similar Items
-
Batched Bandit Problems
by: Perchet, Vianney, et al.
Published: (2015) -
Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
by: Dai, Yan, et al.
Published: (2025) -
Learning Adversarial Markov Decision Processes with Bandit Feedback and Unknown Transition
by: Jin, Chi, et al.
Published: (2022) -
A Structured Multiarmed Bandit Problem and the Greedy Policy
by: Rusmevichientong, Paat, et al.
Published: (2010) -
Branching bandits and Klimov's problem : achievable region and side constraints
Published: (2003)