SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The value of knowing a demand curve: bounds on regret for online posted-price auctions
3 references·16 citing·40 second hop
The value of knowing a demand curve: bounds on regret for online posted-price auctions (2004)The value of knowing a demand curve: boun…Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Gambling in a rigged casino: …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Optimal Auction Design (1981)Optimal Auction DesignFeature-Based Dynamic Pricing (2020)Feature-Based Dynamic PricingNear-Optimal Online Auctions (2018)Near-Optimal Online AuctionsBandits with Knapsacks (2018)Bandits with KnapsacksAutomated Online Mechanism Design and Prophet Inequalities (2018)Automated Online Mechanism De…Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation (2017)Technical Note—Dynamic Pricin…The sample complexity of revenue maximization (2014)The sample complexity of reve…Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (2014)Stochastic Multi-Armed-Bandit…Partial Monitoring—Classification, Regret Bounds, and Algorithms (2014)Partial Monitoring—Classifica…Bandits with Knapsacks (2013)Bandits with KnapsacksLearning on a budget (2012)Learning on a budgetAdapting to a Changing Environment: the Brownian Restless Bandits. (2008)Adapting to a Changing Enviro…Regret Minimization Under Partial Monitoring (2006)Regret Minimization Under Par…Competitive auctions (2006)Competitive auctionsOnline auctions with re-usable goods (2005)Online auctions with re-usabl…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…Adaptive limited-supply online auctions (2004)Adaptive limited-supply onlin…COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)A Theory of Auctions and Competitive Bidding (1982)Efficient mechanisms for bilateral trading (1983)The interdisciplinary study of coordination (1994)Stochastic Estimation of the Maximum of a Regression Function (1952)Online convex programming and generalized infinitesimal gradient ascent (2003)Contextual Bandits with Similarity Information (2009)Interactively optimizing information retrieval systems as a dueling bandits problem (2009)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)The Nonstochastic Multiarmed Bandit Problem (2002)Bandits with concave rewards and convex knapsacks (2014)Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)Truthful mechanisms for one-parameter agents (2001)Truth revelation in approximately efficient combinatorial auctions (2002)Towards a characterization of truthful combinatorial auctions (2004)A framework for truthful online auctions in cloud computing with heterogeneous user demands (2013)A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands (2015)Prediction, Learning, and Games (2006)Time-Varying Gaussian Process Bandit Optimization (2016)A Change-Detection Based Framework for Piecewise-Stationary Multi-Armed Bandit Problem (2018)Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (2019)Competitive auctions and digital goods (2001)Twenty Lectures on Algorithmic Game Theory (2016)Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist when Demands are Interdependent (1985)Auctions Versus Negotiations (1996)A Simple and Approximately Optimal Mechanism for an Additive Buyer (2014)Robustness in Mechanism Design and Contracting (2019)The AI Economist: Improving Equality and Productivity with AI-Driven Tax Policies (2020)Some aspects of the sequential design of experiments (1952)Multi-Armed Bandit Allocation Indices. (1990)Adaptive Game Playing Using Multiplicative Weights (1999)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)The Simple Economics of Optimal Auctions (1989)Truthful randomized mechanisms for combinatorial auctions (2006)Tractable stochastic analysis in high dimensions via robust optimization (2012)Data market platforms (2020)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1981Optimal Auction Design5,938 cited
  • 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem741 cited

Cited by

  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 2013Bandits with Knapsacks211 cited
  • 2014The sample complexity of revenue maximization198 cited
  • 2014Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards193 cited
  • 2006Competitive auctions191 cited
  • 2004Adaptive limited-supply online auctions180 cited
  • 2005Online auctions with re-usable goods151 cited
  • 2017Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation149 cited
  • 2008Adapting to a Changing Environment: the Brownian Restless Bandits.141 cited
  • 2006Regret Minimization Under Partial Monitoring138 cited
  • 2018Bandits with Knapsacks137 cited
  • 2018Automated Online Mechanism Design and Prophet Inequalities136 cited
  • 2020Feature-Based Dynamic Pricing

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

128 cited
  • 2014Partial Monitoring—Classification, Regret Bounds, and Algorithms117 cited
  • 2012Learning on a budget113 cited
  • 2018Near-Optimal Online Auctions110 cited