:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Jin, Yaonan
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	https://arxiv.org/abs/2601.16412
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
por: Lunghi, Anna, et al.
Publicado: (2025)

Bilateral Trade Under Heavy-Tailed Valuations: Minimax Regret with Infinite Variance
por: Zhao, Hangyi
Publicado: (2026)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
por: Tsuchiya, Taira
Publicado: (2025)

Contextual Online Bilateral Trade
por: Cosson, Romain, et al.
Publicado: (2026)

Fair Online Bilateral Trade
por: Bachoc, François, et al.
Publicado: (2024)

Nonparametric Contextual Online Bilateral Trade
por: Coccia, Emanuele, et al.
Publicado: (2026)

A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
por: Bachoc, François, et al.
Publicado: (2025)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
por: Maiti, Arnab, et al.
Publicado: (2023)

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

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

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

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

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

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

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

Repeated Bilateral Trade Against a Smoothed Adversary
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
por: Ba, Wenjia, et al.
Publicado: (2021)

A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Search
por: Cai, Yang, 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)

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

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)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
por: Jordan, Michael I., et al.
Publicado: (2023)

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)

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)

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

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