Strategizing against No-Regret Learners in First-Price Auctions
Fuente:
arXiv
Saved in:
| Main Authors: | Rubinstein, Aviad, Zhao, Junyao |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Secretary, Prophet, and Stochastic Probing via Big-Decisions-First
by: Rubinstein, Aviad, et al.
Published: (2026)
by: Rubinstein, Aviad, et al.
Published: (2026)
Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
by: Rubinstein, Aviad
Published: (2016)
by: Rubinstein, Aviad
Published: (2016)
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)
Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
by: Podimata, Chara, et al.
Published: (2020)
by: Podimata, Chara, et al.
Published: (2020)
The complexity of approximate (coarse) correlated equilibrium for incomplete information games
by: Peng, Binghui, et al.
Published: (2024)
by: Peng, Binghui, et al.
Published: (2024)
Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
by: Golrezaei, Negin, et al.
Published: (2024)
by: Golrezaei, Negin, et al.
Published: (2024)
Optimal Single-Choice Prophet Inequalities from Samples
by: Rubinstein, Aviad, et al.
Published: (2019)
by: Rubinstein, Aviad, et al.
Published: (2019)
Online Combinatorial Allocations and Auctions with Few Samples
by: Dütting, Paul, et al.
Published: (2024)
by: Dütting, Paul, et al.
Published: (2024)
Procurement Auctions via Approximately Optimal Submodular Optimization
by: Deng, Yuan, et al.
Published: (2024)
by: Deng, Yuan, et al.
Published: (2024)
High-Dimensional Calibration from Swap Regret
by: Fishelson, Maxwell, et al.
Published: (2025)
by: Fishelson, Maxwell, et al.
Published: (2025)
Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)
by: Zhao, Junyao
Published: (2025)
Simultaneous Swap Regret Minimization via KL-Calibration
by: Luo, Haipeng, et al.
Published: (2025)
by: Luo, Haipeng, et al.
Published: (2025)
Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
by: Liu, Junyan, et al.
Published: (2025)
by: Liu, Junyan, et al.
Published: (2025)
Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2025)
by: Charalampopoulos, Andreas, et al.
Published: (2025)
Improved Algorithms for Contextual Dynamic Pricing
by: Tullii, Matilde, et al.
Published: (2024)
by: Tullii, Matilde, et al.
Published: (2024)
Bandit Sequential Posted Pricing via Half-Concavity
by: Singla, Sahil, et al.
Published: (2023)
by: Singla, Sahil, et al.
Published: (2023)
Learning Optimal Posted Prices for a Unit-Demand Buyer
by: Teng, Yifeng, et al.
Published: (2025)
by: Teng, Yifeng, et al.
Published: (2025)
Learning in Repeated Multi-Unit Pay-As-Bid Auctions
by: Galgana, Rigel, et al.
Published: (2023)
by: Galgana, Rigel, et al.
Published: (2023)
Regret Bounds for Competitive Resource Allocation with Endogenous Costs
by: Chai, Rui
Published: (2026)
by: Chai, Rui
Published: (2026)
Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
by: Kevi, Eniko, et al.
Published: (2024)
by: Kevi, Eniko, et al.
Published: (2024)
Prophet Upper Bounds for Online Matching and Auctions
by: Soto, José, et al.
Published: (2024)
by: Soto, José, et al.
Published: (2024)
A Strongly Polynomial Algorithm for Arctic Auctions
by: Garg, Jugal, et al.
Published: (2026)
by: Garg, Jugal, et al.
Published: (2026)
Bipartiteness in Progressive Second-Price Multi-Auction Networks with Perfect Substitute
by: Blazek, Jordana, et al.
Published: (2025)
by: Blazek, Jordana, et al.
Published: (2025)
Repeated Descent: A Framework for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2026)
by: Charalampopoulos, Andreas, et al.
Published: (2026)
Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
by: Ganesh, Aadityan, et al.
Published: (2025)
by: Ganesh, Aadityan, et al.
Published: (2025)
From No-Regret to Strategically Robust Learning in Repeated Auctions
by: Zhao, Junyao
Published: (2026)
by: Zhao, Junyao
Published: (2026)
Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
by: Eden, Alon, et al.
Published: (2024)
by: Eden, Alon, et al.
Published: (2024)
Complexity of Auctions with Interdependence
by: Loiseau, Patrick, et al.
Published: (2026)
by: Loiseau, Patrick, et al.
Published: (2026)
Optimal Pricing with Unreliable Signals
by: Tang, Zhihao Gavin, et al.
Published: (2026)
by: Tang, Zhihao Gavin, et al.
Published: (2026)
Strategic Facility Location via Predictions
by: Chen, Qingyun, et al.
Published: (2024)
by: Chen, Qingyun, et al.
Published: (2024)
Logarithmic Approximation for Road Pricing on Grids
by: Constantinescu, Andrei, et al.
Published: (2025)
by: Constantinescu, Andrei, et al.
Published: (2025)
Static Pricing Guarantees for Queueing Systems
by: Bergquist, Jacob, et al.
Published: (2023)
by: Bergquist, Jacob, et al.
Published: (2023)
Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)
by: McMahan, Jeremy, et al.
Published: (2024)
Tractable Agreement Protocols
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
High dimensional online calibration in polynomial time
by: Peng, Binghui
Published: (2025)
by: Peng, Binghui
Published: (2025)
Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025)
by: Vaze, Rahul, et al.
Published: (2025)
On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)
by: Hanneke, Steve, et al.
Published: (2026)
An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)
by: Azar, Yossi, et al.
Published: (2022)
Similar Items
-
Secretary, Prophet, and Stochastic Probing via Big-Decisions-First
by: Rubinstein, Aviad, et al.
Published: (2026) -
Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
by: Rubinstein, Aviad
Published: (2016) -
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023) -
Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
by: Podimata, Chara, et al.
Published: (2020) -
The complexity of approximate (coarse) correlated equilibrium for incomplete information games
by: Peng, Binghui, et al.
Published: (2024)