Cover Image

Learning Local Stackelberg Equilibria from Repeated Interactions with a Learning Agent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ananthakrishnan, Nivasini, Dagan, Yuval, Yang, Kunhe
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions
by: Ananthakrishnan, Nivasini, et al.
Published: (2024)

Power and Limitations of Aggregation in Compound AI Systems
by: Ananthakrishnan, Nivasini, et al.
Published: (2026)

Privacy Can Arise Endogenously in an Economic System with Learning Agents
by: Ananthakrishnan, Nivasini, et al.
Published: (2024)

Signaling in Data Markets via Free Samples
by: Ananthakrishnan, Nivasini, et al.
Published: (2026)

Learning in Structured Stackelberg Games
by: Balcan, Maria-Florina, et al.
Published: (2025)

Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
by: Shao, Han, et al.
Published: (2025)

Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?
by: Gölz, Paul, et al.
Published: (2025)

Fundamental Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2023)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2024)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
by: Liu, Junyan, et al.
Published: (2025)

Maximizing utility in multi-agent environments by anticipating the behavior of other learners
by: Assos, Angelos, et al.
Published: (2024)

Impact of Decentralized Learning on Player Utilities in Stackelberg Games
by: Donahue, Kate, et al.
Published: (2024)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
by: Zhang, Brian Hu, et al.
Published: (2025)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2025)

ReLExS: Reinforcement Learning Explanations for Stackelberg No-Regret Learners
by: Huang, Xiangge, et al.
Published: (2024)

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces
by: Dagan, Yuval, et al.
Published: (2023)

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games
by: Kamp, Serafina, et al.
Published: (2025)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
by: Sychrovský, David, et al.
Published: (2025)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
by: Cai, Yang, et al.
Published: (2025)

Active Inverse Learning in Stackelberg Trajectory Games
by: Ward, William, et al.
Published: (2023)

Decentralized and Privacy-Preserving Learning of Approximate Stackelberg Solutions in Energy Trading Games with Demand Response Aggregators
by: Kampezidou, Styliani I., et al.
Published: (2023)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

Learning to Play Multi-Follower Bayesian Stackelberg Games
by: Personnat, Gerson, et al.
Published: (2025)

On Tractable $Φ$-Equilibria in Non-Concave Games
by: Cai, Yang, et al.
Published: (2024)

Regret Minimization in Stackelberg Games with Side Information
by: Harris, Keegan, et al.
Published: (2024)

Online Stackelberg Optimization via Nonlinear Control
by: Brown, William, et al.
Published: (2024)

Optimally Installing Strict Equilibria
by: McMahan, Jeremy, et al.
Published: (2025)

Zeroth-Order Stackelberg Control in Combinatorial Congestion Games
by: Masiha, Saeed, et al.
Published: (2026)

Multiplayer Bandit Learning, from Competition to Cooperation
by: Brânzei, Simina, et al.
Published: (2019)

Nash Equilibria via Stochastic Eigendecomposition
by: Gemp, Ian
Published: (2024)

Operator Splitting for Learning to Predict Equilibria in Convex Games
by: McKenzie, Daniel, et al.
Published: (2021)

Learning to Bid in Non-Stationary Repeated First-Price Auctions
by: Hu, Zihao, et al.
Published: (2025)

Learnable Mixed Nash Equilibria are Collectively Rational
by: So, Geelon, et al.
Published: (2025)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)

A Learning Algorithm That Attains the Human Optimum in a Repeated Human-Machine Interaction Game
by: Isa, Jason T., et al.
Published: (2025)

Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps
by: Zhong, Guangzheng, et al.
Published: (2025)

Learning to Lead: Incentivizing Strategic Agents in the Dark
by: Wu, Yuchen, et al.
Published: (2025)

Robust Stackelberg Equilibria
by: Gan, Jiarui, et al.
Published: (2023)