Cover Image

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Balcan, Maria-Florina, Bernasconi, Martino, Castiglioni, Matteo, Celli, Andrea, Harris, Keegan, Wu, Zhiwei Steven
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Single-dimensional Contract Design: Efficient Algorithms and Learning
by: Bernasconi, Martino, et al.
Published: (2025)

The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)

Agent-Designed Contracts: How to Sell Hidden Actions
by: Bernasconi, Martino, et al.
Published: (2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance
by: Bernasconi, Martino, et al.
Published: (2023)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
by: Bernasconi, Martino, et al.
Published: (2024)

Feature-Based Online Bilateral Trade
by: Gaucher, Solenne, et al.
Published: (2024)

Optimal Rates for Feasible Payoff Set Estimation in Games
by: Barbara, Annalisa, et al.
Published: (2026)

Bicriteria Multidimensional Mechanism Design with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2023)

The Complexity of Min-Max Optimization with Product Constraints
by: Bernasconi, Martino, et al.
Published: (2026)

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Regret-Minimizing Contracts: Agency Under Uncertainty
by: Bernasconi, Martino, et al.
Published: (2024)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

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

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Multi-Agent Contract Design beyond Binary Actions
by: Cacciamani, Federico, et al.
Published: (2024)

New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs
by: Balcan, Maria-Florina, et al.
Published: (2023)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

Subsidy design for better social outcomes
by: Balcan, Maria-Florina, et al.
Published: (2024)

Revenue-Optimal Efficient Mechanism Design with General Type Spaces
by: Prasad, Siddharth, et al.
Published: (2025)

The Active and Noise-Tolerant Strategic Perceptron
by: Balcan, Maria-Florina, et al.
Published: (2025)

Constrained Phi-Equilibria
by: Bernasconi, Martino, et al.
Published: (2023)

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
by: Zhang, Brian Hu, et al.
Published: (2026)

Online Two-Sided Markets: Many Buyers Enhance Learning
by: Lunghi, Anna, et al.
Published: (2025)

The Complexity of Equilibrium Refinements in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
by: Prasad, Siddharth, et al.
Published: (2025)

Hiring for An Uncertain Task: Joint Design of Information and Contracts
by: Castiglioni, Matteo, et al.
Published: (2024)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
by: Zhang, Brian, et al.
Published: (2022)

Bandits with Preference Feedback: A Stackelberg Game Perspective
by: Pásztor, Barna, et al.
Published: (2024)

Satisfaction and Regret in Stackelberg Games
by: White, Langford, et al.
Published: (2024)

Learning in Conjectural Stackelberg Games
by: Morri, Francesco, et al.
Published: (2025)

Learning in Stackelberg Markov Games
by: He, Jun, et al.
Published: (2025)

A Stackelberg Game Model of Flocking
by: Wang, Chenlan, et al.
Published: (2024)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

Efficient Stackelberg Strategies for Finitely Repeated Games
by: Collina, Natalie, et al.
Published: (2022)

Is Learning Effective in Dynamic Strategic Interactions? Evidence from Stackelberg Games
by: Albert, Michael, et al.
Published: (2025)

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2023)

Incentive-Aware Synthetic Control: Accurate Counterfactual Estimation via Incentivized Exploration
by: Ngo, Daniel, et al.
Published: (2023)

Vulnerability and Defence: A Case for Stackelberg Game Dynamics
by: Iqbal, Azhar, et al.
Published: (2025)