Cover Image

Regret Minimization in Bilateral Trade With Perturbed Markets

Fuente: arXiv

Saved in:

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

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

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)

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

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

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)

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

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

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)

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

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

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

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

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

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

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

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

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)

Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
by: Potfer, Marius, et al.
Published: (2025)

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

Next-Token Prediction and Regret Minimization
by: Mohri, Mehryar, et al.
Published: (2026)

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

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

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

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

Real-Time Parallel Counterfactual Regret Minimization
by: Li, Boning, et al.
Published: (2026)

Deep (Predictive) Discounted Counterfactual Regret Minimization
by: Xu, Hang, et al.
Published: (2025)

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

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

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

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)