Cover Image

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lunghi, Anna, Castiglioni, Matteo, Marchesi, Alberto
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

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

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

A Stronger Benchmark for Online Bilateral Trade: From Fixed Prices to Distributions
by: Lunghi, Anna, et al.
Published: (2026)

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

Online Two-Sided Markets: Many Buyers Enhance Learning
by: Lunghi, Anna, et al.
Published: (2025)

Regret-Minimizing Contracts: Agency Under Uncertainty
by: Bernasconi, Martino, et al.
Published: (2024)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)

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

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

Markov Persuasion Processes: Learning to Persuade from Scratch
by: Bacchiocchi, Francesco, et al.
Published: (2024)

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

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

Feature-Based Online Bilateral Trade
by: Gaucher, Solenne, et al.
Published: (2024)

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

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

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

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

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

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
by: Bollini, Matteo, et al.
Published: (2024)

Online Bayesian Persuasion Without a Clue
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Contract Design Under Approximate Best Responses
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Online Resource Allocation With General Constraints
by: Chiefari, Eleonora Fidelia, et al.
Published: (2026)

Constrained Phi-Equilibria
by: Bernasconi, Martino, et al.
Published: (2023)

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

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

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

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

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

Constraint-Aware Generative Auto-bidding via Pareto-Prioritized Regret Optimization
by: Wu, Binglin, et al.
Published: (2026)

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)

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

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

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
by: Duan, Zhijian, et al.
Published: (2025)