Imagen de Portada

No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Su, Yiheng, Vlatakis-Gkaragkounis, Emmanouil-Vasileios
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Prudent-Banker: No Extra Fees for Baseline Safety in Adversarial Bandits With and Without Delays
por: Hu, Ting, et al.
Publicado: (2026)

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

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

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

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

Contracting with a Learning Agent
por: Guruganesh, Guru, et al.
Publicado: (2024)

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

Barriers to Welfare Maximization with No-Regret Learning
por: Anagnostides, Ioannis, et al.
Publicado: (2024)

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
por: Di Gregorio, Simone, et al.
Publicado: (2025)

Multi-Parameter Mechanisms for Consumer Surplus Maximization
por: Ezra, Tomer, et al.
Publicado: (2024)

From No-Regret to Strategically Robust Learning in Repeated Auctions
por: Zhao, Junyao
Publicado: (2026)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
por: Bechavod, Yahav, et al.
Publicado: (2025)

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
por: Lucier, Brendan, et al.
Publicado: (2023)

Learning not to Regret
por: Sychrovský, David, et al.
Publicado: (2023)

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

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

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
por: Yang, Zongjun, et al.
Publicado: (2026)

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

Regret Analysis of Repeated Delegated Choice
por: Hajiaghayi, MohammadTaghi, et al.
Publicado: (2023)

GPU-Accelerated Counterfactual Regret Minimization
por: Kim, Juho
Publicado: (2024)

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

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

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

Regret Minimization in Bilateral Trade With Perturbed Markets
por: Lunghi, Anna, et al.
Publicado: (2026)

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

Forecasting for Swap Regret for All Downstream Agents
por: Roth, Aaron, et al.
Publicado: (2024)

Meta-Learning in Self-Play Regret Minimization
por: Sychrovský, David, et al.
Publicado: (2025)

The Relationship between No-Regret Learning and Online Conformal Prediction
por: Ramalingam, Ramya, et al.
Publicado: (2025)

Selling Joint Ads: A Regret Minimization Perspective
por: Aggarwal, Gagan, et al.
Publicado: (2024)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
por: Jin, Yaonan
Publicado: (2026)

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

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
por: Aggarwal, Gagan, et al.
Publicado: (2024)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
por: Cai, Yang, et al.
Publicado: (2023)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
por: Bacchiocchi, Francesco, et al.
Publicado: (2025)

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

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

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

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

Computational Lower Bounds for Regret Minimization in Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2024)