Learning to Play Against Unknown Opponents
Fuente:
arXiv
Saved in:
| Main Authors: | Arunachaleswaran, Eshwar Ram, Collina, Natalie, Schneider, Jon |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Pareto-Optimal Algorithms for Learning in Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
Breaking Algorithmic Collusion in Human-AI Ecosystems
by: Collina, Natalie, et al.
Published: (2025)
by: Collina, Natalie, et al.
Published: (2025)
Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)
Efficient Stackelberg Strategies for Finitely Repeated Games
by: Collina, Natalie, et al.
Published: (2022)
by: Collina, Natalie, et al.
Published: (2022)
Algorithmic Collusion Without Threats
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)
Towards Sustainable Investment Policies Informed by Opponent Shaping
by: Duque, Juan Agustin, et al.
Published: (2026)
by: Duque, Juan Agustin, et al.
Published: (2026)
Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
LOQA: Learning with Opponent Q-Learning Awareness
by: Aghajohari, Milad, et al.
Published: (2024)
by: Aghajohari, Milad, et al.
Published: (2024)
Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)
by: Schneider, Jon, et al.
Published: (2022)
Tractable Agreement Protocols
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
Emergent Alignment via Competition
by: Collina, Natalie, et al.
Published: (2025)
by: Collina, Natalie, et al.
Published: (2025)
Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)
by: Kumar, Rachitesh, et al.
Published: (2024)
Bandit Social Learning with Exploration Episodes
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)
by: Braverman, Mark, et al.
Published: (2025)
Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)
by: Bollini, Matteo, et al.
Published: (2026)
Distributional Alignment Games for Answer-Level Fine-Tuning
by: Mohri, Mehryar, et al.
Published: (2026)
by: Mohri, Mehryar, et al.
Published: (2026)
Strategizing against No-regret Learners
by: Deng, Yuan, et al.
Published: (2019)
by: Deng, Yuan, et al.
Published: (2019)
Recommending Best Paper Awards for ML/AI Conferences via the Isotonic Mechanism
by: Wen, Garrett G., et al.
Published: (2026)
by: Wen, Garrett G., et al.
Published: (2026)
Meta-Learning in Self-Play Regret Minimization
by: Sychrovský, David, et al.
Published: (2025)
by: Sychrovský, David, et al.
Published: (2025)
Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)
by: Leme, Renato Paes, et al.
Published: (2022)
The Value of Ambiguous Commitments in Multi-Follower Games
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
Analysing the Sample Complexity of Opponent Shaping
by: Fung, Kitty, et al.
Published: (2024)
by: Fung, Kitty, et al.
Published: (2024)
Collaborative Prediction: Tractable Information Aggregation via Agreement
by: Collina, Natalie, et al.
Published: (2025)
by: Collina, Natalie, et al.
Published: (2025)
GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning
by: Fan, Zhiyuan, et al.
Published: (2026)
by: Fan, Zhiyuan, et al.
Published: (2026)
Strategic Classification under Unknown Personalized Manipulation
by: Shao, Han, et al.
Published: (2023)
by: Shao, Han, et al.
Published: (2023)
One-Shot Strategic Classification Under Unknown Costs
by: Rosenfeld, Elan, et al.
Published: (2023)
by: Rosenfeld, Elan, et al.
Published: (2023)
Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
by: Lazarsfeld, John, et al.
Published: (2025)
by: Lazarsfeld, John, et al.
Published: (2025)
Efficient Opportunistic Approachability
by: Marinov, Teodor Vanislavov, et al.
Published: (2026)
by: Marinov, Teodor Vanislavov, et al.
Published: (2026)
Safe Exploitative Play with Untrusted Type Beliefs
by: Li, Tongxin, et al.
Published: (2024)
by: Li, Tongxin, et al.
Published: (2024)
Playing Markov Games Without Observing Payoffs
by: Ablin, Daniel, et al.
Published: (2025)
by: Ablin, Daniel, et al.
Published: (2025)
Personalization Aids Pluralistic Alignment Under Competition
by: Collina, Natalie, et al.
Published: (2026)
by: Collina, Natalie, et al.
Published: (2026)
Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)
by: Fishelson, Maxwell, et al.
Published: (2025)
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)
by: Li, Yingru, et al.
Published: (2024)
Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
by: Qiu, Shuang, et al.
Published: (2022)
by: Qiu, Shuang, et al.
Published: (2022)
The ICML 2023 Ranking Experiment: Examining Author Self-Assessment in ML/AI Peer Review
by: Su, Buxin, et al.
Published: (2024)
by: Su, Buxin, et al.
Published: (2024)
Learning to Play Multi-Follower Bayesian Stackelberg Games
by: Personnat, Gerson, et al.
Published: (2025)
by: Personnat, Gerson, et al.
Published: (2025)
Pure Exploration via Frank-Wolfe Self-Play
by: Liu, Xinyu, et al.
Published: (2025)
by: Liu, Xinyu, et al.
Published: (2025)
No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
by: Su, Yiheng, et al.
Published: (2026)
by: Su, Yiheng, et al.
Published: (2026)
An Elementary Predictor Obtaining $2\sqrt{T}+1$ Distance to Calibration
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
Similar Items
-
Pareto-Optimal Algorithms for Learning in Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024) -
Breaking Algorithmic Collusion in Human-AI Ecosystems
by: Collina, Natalie, et al.
Published: (2025) -
Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025) -
Efficient Stackelberg Strategies for Finitely Repeated Games
by: Collina, Natalie, et al.
Published: (2022) -
Algorithmic Collusion Without Threats
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)