Cover Image

Strategizing against No-regret Learners

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deng, Yuan, Schneider, Jon, Sivan, Balusubramanian
Format:	Preprint
Published:	2019
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

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)

Strategizing against No-Regret Learners in First-Price Auctions
by: Rubinstein, Aviad, et al.
Published: (2024)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
by: Fujii, Kaito
Published: (2023)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
by: Komiyama, Junpei, et al.
Published: (2025)

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
by: Lei, Qi, et al.
Published: (2020)

Computational Intractability of Strategizing against Online Learners
by: Assos, Angelos, et al.
Published: (2025)

Optimal No-regret Learning in Repeated First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
by: Mortazavi, Ali, et al.
Published: (2024)

Distributional Alignment Games for Answer-Level Fine-Tuning
by: Mohri, Mehryar, et al.
Published: (2026)

Strategic Usage in a Multi-Learner Setting
by: Shekhtman, Eliot, et al.
Published: (2024)

Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)

Learning to Play Against Unknown Opponents
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)

Learning to Steer Learners in Games
by: Zhang, Yizhou, et al.
Published: (2025)

Responding to Promises: No-regret learning against followers with memory
by: Hebbar, Vijeth, et al.
Published: (2024)

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

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

Bayesian Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)

Efficient Opportunistic Approachability
by: Marinov, Teodor Vanislavov, et al.
Published: (2026)

Learnability Gaps of Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)

Strategic Linear Contextual Bandits
by: Buening, Thomas Kleine, et al.
Published: (2024)

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

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

On Randomized Algorithms in Online Strategic Classification
by: Hutton, Chase, et al.
Published: (2026)

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

Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)

Strategic Classification under Unknown Personalized Manipulation
by: Shao, Han, et al.
Published: (2023)

To Give or Not to Give? The Impacts of Strategically Withheld Recourse
by: Chen, Yatong, et al.
Published: (2025)

Understanding Model Selection For Learning In Strategic Environments
by: Handina, Tinashe, et al.
Published: (2024)

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

Is Online Linear Optimization Sufficient for Strategic Robustness?
by: Cai, Yang, et al.
Published: (2026)

Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
by: Ehrenberg, Maayan, et al.
Published: (2024)

A Machine Learning Theory Perspective on Strategic Litigation
by: Dutz, Melissa, et al.
Published: (2025)

One-Shot Strategic Classification Under Unknown Costs
by: Rosenfeld, Elan, et al.
Published: (2023)

Fairness-aware Contextual Dynamic Pricing with Strategic Buyers
by: Liu, Pangpang, et al.
Published: (2025)

Strategic Incentivization for Locally Differentially Private Federated Learning
by: Pagoti, Yashwant Krishna, et al.
Published: (2025)

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