Cover Image

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Zixian, Varma, Sushil Mahavir, Ying, Lei
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory Optimization and Control Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Based Pricing and Matching for Two-Sided Queues
by: Yang, Zixian, et al.
Published: (2024)

Dynamic Pricing and Matching for Two-Sided Queues
by: Varma, Sushil Mahavir, et al.
Published: (2019)

Efficiency-Reward Trade-Off in Queues with Dynamic Arrivals
by: Qu, Tianze, et al.
Published: (2026)

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

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

Queues with inspection cost: To see or not to see?
by: Clarkson, Jake, et al.
Published: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

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

Minimal Regret Walras Equilibria for Combinatorial Markets
by: Duguet, Aloïs, et al.
Published: (2025)

On Approximate Nash Equilibria in Mean Field Games
by: Djete, Mao Fabrice, et al.
Published: (2026)

On Time-Inconsistency in Mean Field Games
by: Bayraktar, Erhan, et al.
Published: (2023)

Sequential Fair Allocation With Replenishments: A Little Envy Goes An Exponentially Long Way
by: Onyeze, Chido, et al.
Published: (2025)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
by: Cai, Yang, et al.
Published: (2024)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, et al.
Published: (2025)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Matching Queues, Flexibility and Incentives
by: Yan, Chiwei, et al.
Published: (2020)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Near-feasible Fair Allocations in Two-sided Markets
by: Cembrano, Javier, et al.
Published: (2025)

Optimal Online Bookmaking for Binary Games
by: Bhatt, Alankrita, et al.
Published: (2025)

Optimal Online Bookmaking for Any Number of Outcomes
by: Tal, Hadar, et al.
Published: (2025)

Fair Incentives for Repeated Engagement
by: Freund, Daniel, et al.
Published: (2021)

Energy Storage Arbitrage in Two-settlement Markets: A Transformer-Based Approach
by: Alghumayjan, Saud, et al.
Published: (2024)

Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions
by: Besançon, Mathieu, et al.
Published: (2019)

Optimistic Online Learning in Symmetric Cone Games
by: Barakat, Anas, et al.
Published: (2025)

Optimal Selection with Balanced Market Share: Static and Dynamic Assortment Optimization
by: Housni, Omar El, et al.
Published: (2025)

Regularity properties of distributions of correspondences without countable generation: applications to large games
by: Otsuka, Motoki
Published: (2025)

A Soft Inducement Framework for Incentive-Aided Steering of No-Regret Players
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Learning Paths to Multi-Sector Equilibrium: Belief Dynamics Under Uncertain Returns to Scale
by: Nasini, Stefano, et al.
Published: (2025)

Side-Constrained Dynamic Traffic Equilibria
by: Graf, Lukas, et al.
Published: (2022)

A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
by: Laurière, Mathieu, et al.
Published: (2024)

Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements
by: Jalota, Devansh, et al.
Published: (2022)

Online Multi-Agent Control with Adversarial Disturbances
by: Barakat, Anas, et al.
Published: (2025)

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
by: Shen, Lingqing, et al.
Published: (2024)

Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
by: Qiu, Shuang, et al.
Published: (2022)

Optimal Guarantees for Online Selection Over Time
by: Perez-Salazar, Sebastian, et al.
Published: (2024)

Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers
by: Blanchard, Moise, et al.
Published: (2024)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
by: Cai, Yang, et al.
Published: (2024)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
by: Cai, Yang, et al.
Published: (2025)

A Direct Second-Order Method for Solving Two-Player Zero-Sum Games
by: Yang, David, et al.
Published: (2025)