SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Regret Minimization for Reserve Prices in Second-Price Auctions
11 references·11 citing·37 second hop
Regret Minimization for Reserve Prices in Second-Price Auctions (2014)Regret Minimization for Reserve Prices in…X -Armed Bandits (2011)X -Armed BanditsReserve prices in internet advertising auctions (2011)Reserve prices in internet ad…Revenue maximization with a single sample (2010)Revenue maximization with a s…Introduction to Mechanism Design (for Computer Scientists) (2007)Introduction to Mechanism Des…Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Improved Rates for the Stocha…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…The value of knowing a demand curve: bounds on regret for online posted-price auctions (2004)The value of knowing a demand…Inference with an Incomplete Model of English Auctions (2003)Inference with an Incomplete …Identification of Standard Auction Models (2002)Identification of Standard Au…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Optimal Auction Design (1981)Optimal Auction DesignBayesian dynamic learning and pricing with strategic customers (2022)Bayesian dynamic learning and…Using survival prediction techniques to learn consumer-specific reservation price distributions (2021)Using survival prediction tec…Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Bypassing the Monster: A Fast…Optimal display-ad allocation with guaranteed contracts and supply side platforms (2019)Optimal display-ad allocation…Learning to Bid Without Knowing your Value (2018)Learning to Bid Without Knowi…Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions (2018)Dynamic Incentive-Aware Learn…Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization (2018)Dispersion for Data-Driven Al…A Perspective on Incentive Design: Challenges and Opportunities (2018)A Perspective on Incentive De…Revenue Optimization with Approximate Bid Predictions (2017)Revenue Optimization with App…Ironing in the Dark (2016)Ironing in the DarkA Field Guide to Personalized Reserve Prices (2016)A Field Guide to Personalized…The Continuum-Armed Bandit Problem (1995)Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Contextual Multi-Armed Bandits (2010)Stochastic Convex Optimization with Bandit Feedback (2013)Bandit Algorithms for Tree Search (2014)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Theory of games and economic behavior (2019)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Efficient mechanisms for bilateral trading (1983)The interdisciplinary study of coordination (1994)Incentives in Teams (1973)Optimal Auction Design and Equilibrium Selection in Sponsored Search Auctions (2010)Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reserve (2013)Assessing Sale Strategies in Online Markets Using Matched Listings (2015)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Bandits with Knapsacks (2013)The sample complexity of revenue maximization (2014)The Nonstochastic Multiarmed Bandit Problem (2002)Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness (2011)Thompson Sampling for Complex Online Problems (2014)A Theory of Auctions and Competitive Bidding (1982)An Introduction to Copulas (1999)Winner's Curse, Reserve Prices and Endogenous Entry: Empirical Insights from Ebay Auctions (2000)Nonparametric Tests for Common Values at First-Price Sealed-Bid Auctions (2003)Demand Estimation with Heterogeneous Consumers and Unobserved Product Characteristics: A Hedonic Approach (2005)The Empirical Content of the Roy Model (1990)Optimal Nonparametric Estimation of First-price Auctions (2000)Chapter 60 Nonparametric Approaches to Auctions (2007)Chapter 64 Structural Econometric Modeling: Rationales and Examples from Industrial Organization (2007)Complementary Bidding Mechanisms and Startup Costs in Electricity Markets (2014)Game Theoretic Problems in Network Economics and Mechanism Design Solutions (2009)Optimal social choice functions: A utilitarian view (2015)Introduction to Computational Social Choice (2016)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1981Optimal Auction Design5,938 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2003Inference with an Incomplete Model of English Auctions492 cited
  • 2007Introduction to Mechanism Design (for Computer Scientists)300 cited
  • 2004The value of knowing a demand curve: bounds on regret for online posted-price auctions296 cited
  • 2002Identification of Standard Auction Models211 cited
  • 2011X -Armed Bandits205 cited
  • 2007Improved Rates for the Stochastic Continuum-Armed Bandit Problem175 cited
  • 2011Reserve prices in internet advertising auctions164 cited
  • 2010Revenue maximization with a single sample143 cited

Cited by

  • 2018Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions67 cited
  • 2017Revenue Optimization with Approximate Bid Predictions51 cited
  • 2018Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization48 cited
  • 2021Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability46 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

  • 2016Ironing in the Dark44 cited
  • 2018Learning to Bid Without Knowing your Value43 cited
  • 2018A Perspective on Incentive Design: Challenges and Opportunities41 cited
  • 2016A Field Guide to Personalized Reserve Prices39 cited
  • 2022Bayesian dynamic learning and pricing with strategic customers35 cited
  • 2019Optimal display-ad allocation with guaranteed contracts and supply side platforms16 cited
  • 2021Using survival prediction techniques to learn consumer-specific reservation price distributions9 cited