Cover Image

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Di Gregorio, Simone, Dütting, Paul, Fusco, Federico, Schwiegelshohn, Chris
Format:	Preprint
Published:	2025
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

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

Private Learning in Bilateral Trade
by: Di Gregorio, Simone, et al.
Published: (2026)

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

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

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

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

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

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

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

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

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

Trading Volume Maximization with Online Learning
by: Cesari, Tommaso, et al.
Published: (2024)

Learning not to Regret
by: Sychrovský, David, et al.
Published: (2023)

Efficient Two-Sided Markets with Limited Information
by: Dütting, Paul, et al.
Published: (2020)

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

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

GPU-Accelerated Counterfactual Regret Minimization
by: Kim, Juho
Published: (2024)

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)

Principal-Agent Reinforcement Learning: Orchestrating AI Agents with Contracts
by: Ivanov, Dima, et al.
Published: (2024)

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

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

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

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

Online Combinatorial Allocations and Auctions with Few Samples
by: Dütting, Paul, et al.
Published: (2024)

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

A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Search
by: Cai, Yang, et al.
Published: (2026)

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

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

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