Problem-Independent Regrets on Expectation-Dependent Multi-Armed Bandits
Name
ai-ruiai-sm-idss-2025-thesis.pdf
Description
Thesis PDF
Size
876.45 KB
Format
Adobe PDF
Checksum (MD5)
7b6f552a64107bedfee66ddaa7025e25
Author(s)
Ai, Rui
Advisor(s)
Simchi-Levi, David
Date Issued
May 2025
Publisher
Massachusetts Institute of Technology
Abstract
The independence axiom (IA) proposed by Von Neumann and Morgenstern [50] is the cornerstone of the expected utility theory. However, some empirical experiments show that the IA is often violated in the real world. We propose a new kind of multi-armed bandit problem where the expectation of outcomes may influence the agent’s utility which we call expectation-dependent multi-armed bandits and rationalize the choice of agents in Machina’s paradox lacking the IA. We design provably efficient algorithms with low minimax regrets and show their consistency of time horizon T with corresponding regret lower bounds, revealing statistical optimality. Furthermore, as we first consider bandits whose corresponding utility depends on both reality and expectation, it provides a bridge between machine learning and economic behavior theory, shedding light on how to interpret some counterintuitive economic scenarios, like bounded rationality explored by Zhang et al. [54].
MIT Department
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Terms of Use
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Copyright retained by author(s)
Persistent DSpace Link
