Image de couverture de livre

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Podimata, Chara, Slivkins, Aleksandrs
Format:	Preprint
Publié:	2020
Sujets:	Machine Learning Data Structures and Algorithms Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bandit Social Learning: Exploration under Myopic Behavior
par: Banihashem, Kiarash, et autres
Publié: (2023)

Incentivizing Exploration with Selective Data Disclosure
par: Immorlica, Nicole, et autres
Publié: (2018)

Strategizing against No-Regret Learners in First-Price Auctions
par: Rubinstein, Aviad, et autres
Publié: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2023)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
par: Golrezaei, Negin, et autres
Publié: (2024)

Improved Algorithms for Contextual Dynamic Pricing
par: Tullii, Matilde, et autres
Publié: (2024)

Online Combinatorial Allocations and Auctions with Few Samples
par: Dütting, Paul, et autres
Publié: (2024)

Procurement Auctions via Approximately Optimal Submodular Optimization
par: Deng, Yuan, et autres
Publié: (2024)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2025)

Bandit Sequential Posted Pricing via Half-Concavity
par: Singla, Sahil, et autres
Publié: (2023)

Learning Optimal Posted Prices for a Unit-Demand Buyer
par: Teng, Yifeng, et autres
Publié: (2025)

An $α$-regret analysis of Adversarial Bilateral Trade
par: Azar, Yossi, et autres
Publié: (2022)

Repeated Bilateral Trade Against a Smoothed Adversary
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2023)

Learning in Repeated Multi-Unit Pay-As-Bid Auctions
par: Galgana, Rigel, et autres
Publié: (2023)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
par: Kevi, Eniko, et autres
Publié: (2024)

Prophet Upper Bounds for Online Matching and Auctions
par: Soto, José, et autres
Publié: (2024)

A Strongly Polynomial Algorithm for Arctic Auctions
par: Garg, Jugal, et autres
Publié: (2026)

Bipartiteness in Progressive Second-Price Multi-Auction Networks with Perfect Substitute
par: Blazek, Jordana, et autres
Publié: (2025)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2026)

Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
par: Ganesh, Aadityan, et autres
Publié: (2025)

Lipschitz Continuous Allocations for Optimization Games
par: Kumabe, Soh, et autres
Publié: (2024)

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
par: Eden, Alon, et autres
Publié: (2024)

Introduction to Multi-Armed Bandits
par: Slivkins, Aleksandrs
Publié: (2019)

Complexity of Auctions with Interdependence
par: Loiseau, Patrick, et autres
Publié: (2026)

Optimal Pricing with Unreliable Signals
par: Tang, Zhihao Gavin, et autres
Publié: (2026)

Logarithmic Approximation for Road Pricing on Grids
par: Constantinescu, Andrei, et autres
Publié: (2025)

Static Pricing Guarantees for Queueing Systems
par: Bergquist, Jacob, et autres
Publié: (2023)

High dimensional online calibration in polynomial time
par: Peng, Binghui
Publié: (2025)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
par: Liu, Junyan, et autres
Publié: (2025)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
par: Collina, Natalie, et autres
Publié: (2024)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
par: Vaze, Rahul, et autres
Publié: (2025)

High-Dimensional Calibration from Swap Regret
par: Fishelson, Maxwell, et autres
Publié: (2025)

On the Learning Curves of Revenue Maximization
par: Hanneke, Steve, et autres
Publié: (2026)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
par: Attias, Idan, et autres
Publié: (2025)

Simultaneous Swap Regret Minimization via KL-Calibration
par: Luo, Haipeng, et autres
Publié: (2025)

Collaborative Prediction: Tractable Information Aggregation via Agreement
par: Collina, Natalie, et autres
Publié: (2025)

Contextual Learning for Stochastic Optimization
par: Heuser, Anna, et autres
Publié: (2025)

Smooth Nash Equilibria: Algorithms and Complexity
par: Daskalakis, Constantinos, et autres
Publié: (2023)

Water-Filling is Universally Minimax Optimal
par: Banerjee, Siddhartha, et autres
Publié: (2026)

Learning in Stackelberg Games with Non-myopic Agents
par: Haghtalab, Nika, et autres
Publié: (2022)