scientific article; zbMATH DE number 7064042
From MaRDI portal
Publication:5381115
zbMath1489.68406arXiv1705.09700MaRDI QIDQ5381115
Rad Niazadeh, Sébastien Bubeck, Nikhil R. Devanur, Zhi-Yi Huang
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1705.09700
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Worst-case regret analysis of computationally budgeted online kernel selection ⋮ Diffusive limit approximation of pure-jump optimal stochastic control problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reducing mechanism design to algorithm design via machine learning
- The theory and practice of revenue management
- Online learning in online auctions
- Revenue maximization with a single sample
- Truthful Mechanisms with Implicit Payment Computation
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
- Optimal Auction Design
- Bandits with Knapsacks
- Making the Most of Your Samples
- Efficient empirical revenue maximization in single-parameter auction environments
- The sample complexity of revenue maximization
- The sample complexity of auctions with side information
This page was built for publication: