Safe Exploitative Play with Untrusted Type Beliefs
Tongxin Li, Tinashe Handina, Shaolei Ren, Adam Wierman
Abstract
The combination of the Bayesian game and learning has a rich history, with the idea of controlling a single agent in a system composed of multiple agents with unknown behaviors given a set of types, each specifying a possible behavior for the other agents. The idea is to plan an agent's own actions with respect to those types which it believes are most likely to maximize the payoff. However, the type beliefs are often learned from past actions and likely to be incorrect. With this perspective in mind, we consider an agent in a game with type predictions of other components, and investigate the impact of incorrect beliefs to the agent's payoff. In particular, we formally define a tradeoff between risk and opportunity by comparing the payoff obtained against the optimal payoff, which is represented by a gap caused by trusting or distrusting the learned beliefs. Our main results characterize the tradeoff by establishing upper and lower bounds on the Pareto front for both normal-form and stochastic Bayesian games, with numerical results provided.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 49ccaa66-2227-4b72-aa2c-b3f790a64618Cited by top-tier papers1
Ask how each one uses itBuilds on12
- Online metric algorithms with untrusted predictionsAntonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak et al.ICML 2020 · 170 citations
- Near-Optimal Bounds for Online Caching with Machine Learned AdviceDhruv RohatgiSODA 2020 · 88 citations
- The best of both worlds: stochastic and adversarial episodic MDPs with unknown transitionTiancheng Jin, Longbo Huang, Haipeng LuoNeurIPS 2021 · 51 citations
- An Efficient End-to-End Training Approach for Zero-Shot Human-AI CoordinationXue Yan, Jiaxian Guo, Xingzhou Lou, Jun Wang et al.NeurIPS 2023 · 37 citations
- Parsimonious Learning-Augmented CachingSungjin Im, Ravi Kumar, Aditya Petety, Manish PurohitICML 2022 · 32 citations
Related papers
- Learning to Play Multi-Follower Bayesian Stackelberg GamesGerson Personnat, Tao Lin, Safwan Hossain, David C. ParkesICLR 2026 · 5 citations
- Learning in Bayesian Stackelberg Games With Unknown Follower's TypesMatteo Bollini, Francesco Bacchiocchi, Samuel Coutts, Matteo Castiglioni et al.ICML 2026
- Bayesian decision-making under misspecified priors with applications to meta-learningMax Simchowitz, Christopher Tosh, Akshay Krishnamurthy, Daniel J. Hsu et al.NeurIPS 2021 · 57 citations
- Is Learning in Games Good for the Learners?William Brown, Jon Schneider, Kiran VodrahalliNeurIPS 2023 · 27 citations
- Variational Bayesian Reinforcement Learning with Regret BoundsBrendan O'DonoghueNeurIPS 2021 · 48 citations
