Cover Image

Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Potfer, Marius, Perchet, Vianney
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

Improved learning rates in multi-unit uniform price auctions
by: Potfer, Marius, et al.
Published: (2025)

A survey on multi-player bandits
by: Boursier, Etienne, et al.
Published: (2022)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Learning to Bid in FCR Markets: A Best-of-Both-Worlds Approach
by: Potfer, Marius, et al.
Published: (2026)

Improved Algorithms for Contextual Dynamic Pricing
by: Tullii, Matilde, et al.
Published: (2024)

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

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

Stable Matching with Ties: Approximation Ratios and Learning
by: Lin, Shiyun, et al.
Published: (2024)

Learning to Allocate Resources with Censored Feedback
by: Montanari, Giovanni, et al.
Published: (2026)

Strategizing against No-Regret Learners in First-Price Auctions
by: Rubinstein, Aviad, et al.
Published: (2024)

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

A Reinforcement Learning Approach in Multi-Phase Second-Price Auction Design
by: Ai, Rui, et al.
Published: (2022)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
by: Golrezaei, Negin, et al.
Published: (2024)

Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)

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

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)

DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation
by: Garrido-Lucero, Felipe, et al.
Published: (2023)

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)

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

Calibrated Forecasting and Persuasion
by: Jain, Atulya, et al.
Published: (2024)

From No-Regret to Strategically Robust Learning in Repeated Auctions
by: Zhao, Junyao
Published: (2026)

Optimizing Floors in First Price Auctions: an Empirical Study of Yahoo Advertising
by: Alcobendas, Miguel, et al.
Published: (2023)

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

The Price of Opportunity Fairness in Matroid Allocation Problems
by: Castera, Rémi, et al.
Published: (2024)

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

Learning to Bid in Non-Stationary Repeated First-Price Auctions
by: Hu, Zihao, et al.
Published: (2025)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
by: Wang, Yige, 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)

Joint Value Estimation and Bidding in Repeated First-Price Auctions
by: Wen, Yuxiao, et al.
Published: (2025)

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

A Robust Multi-Item Auction Design with Statistical Learning
by: Han, Jiale, et al.
Published: (2023)

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

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

Revenue Variance Minimization: Beyond First Price Auctions
by: Bojko, Marek, et al.
Published: (2024)

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)

Learning in Repeated Multi-Unit Pay-As-Bid Auctions
by: Galgana, Rigel, et al.
Published: (2023)

Learning in Budgeted Auctions with Spacing Objectives
by: Fikioris, Giannis, et al.
Published: (2024)