Cover Image

Prudent-Banker: No Extra Fees for Baseline Safety in Adversarial Bandits With and Without Delays

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hu, Ting, Cai, Luanda, Vlatakis-Gkaragkounis, Emmanouil-Vasileios
Format:	Preprint
Published:	2026
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

Learning Safely Without Knowing the World:COMPASS-Hedge
by: Hu, Ting, et al.
Published: (2026)

No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
by: Su, Yiheng, et al.
Published: (2026)

Solving Neural Min-Max Games: The Role of Architecture, Initialization & Dynamics
by: Patel, Deep, et al.
Published: (2025)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
by: Cai, Yang, et al.
Published: (2023)

Solving Zero-Sum Convex Markov Games
by: Kalogiannis, Fivos, et al.
Published: (2025)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Contracting with a Learning Agent
by: Guruganesh, Guru, et al.
Published: (2024)

Breaking $1/ε$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
by: Su, Yiheng, et al.
Published: (2025)

A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games
by: Vasconcelos, Francisca, et al.
Published: (2023)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

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

Linear Convergence in Games with Delayed Feedback via Extra Prediction
by: Fujimoto, Yuma, et al.
Published: (2026)

Learning from Delayed Feedback in Games via Extra Prediction
by: Fujimoto, Yuma, et al.
Published: (2025)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)

Regret Analysis of Sleeping Competing Bandits
by: Uba, Shinnosuke, et al.
Published: (2026)

p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)

Incentivized Truthful Communication for Federated Bandits
by: Wei, Zhepei, et al.
Published: (2024)

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
by: Feng, Yi, et al.
Published: (2024)

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

Incentive-compatible Bandits: Importance Weighting No More
by: Zimmert, Julian, et al.
Published: (2024)

Incentivized Learning in Principal-Agent Bandit Games
by: Scheid, Antoine, et al.
Published: (2024)

Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
by: Hosseini, Hadi, et al.
Published: (2024)

Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Improved Bandits in Many-to-one Matching Markets with Incentive Compatibility
by: Kong, Fang, et al.
Published: (2024)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

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

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

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
by: Esmaeili, Seyed A., et al.
Published: (2023)

Achieving PAC Guarantees in Mechanism Design through Multi-Armed Bandits
by: Osogami, Takayuki, et al.
Published: (2024)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Leveraging Noisy Observations in Zero-Sum Games
by: Athanasakos, Emmanouil M, et al.
Published: (2024)

Playing Markov Games Without Observing Payoffs
by: Ablin, Daniel, et al.
Published: (2025)

Regularized Proportional Fairness Mechanism for Resource Allocation Without Money
by: Zeng, Sihan, et al.
Published: (2025)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
by: Lazarsfeld, John, et al.
Published: (2025)

Prudent Rationalizability and the Best Rationalization Principle
by: De Vito, Nicodemo
Published: (2025)

Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms
by: Khosravi, Khashayar, et al.
Published: (2023)

Profit Maximization in Bilateral Trade against a Smooth Adversary
by: Di Gregorio, Simone, et al.
Published: (2026)