SZodixStudyAcademic Library
DashboardShelvesOpen accessMy libraryInboxNotesWriteLearnAlerts
More
Ask your libraryNotificationsQuick citeReview
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Learning to Bid Without Knowing your Value
16 references·0 citing·42 second hop
Learning to Bid Without Knowing your Value (2018)Learning to Bid Without Knowing your ValueLearning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)Learning in Repeated Auctions…Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design (2015)Repeated Auctions with Budget…The sample complexity of revenue maximization (2014)The sample complexity of reve…Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (2014)Taming the Monster: A Fast an…Revenue maximization with a single sample (2014)Revenue maximization with a s…Regret Minimization for Reserve Prices in Second-Price Auctions (2014)Regret Minimization for Reser…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Reserve prices in internet advertising auctions (2011)Reserve prices in internet ad…From Bandits to Experts: On the Value of Side-Observations (2011)From Bandits to Experts: On t…Intrinsic robustness of the price of anarchy (2009)Intrinsic robustness of the p…Regret minimization and the price of total anarchy (2008)Regret minimization and the p…Multi-armed bandits in metric spaces (2008)Multi-armed bandits in metric…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Online learning in online auctions (2004)Online learning in online auc…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)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)Optimal Auction Design (1981)Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons (1994)An Analysis of Bid-Price Controls for Network Revenue Management (1998)Marketplaces, Markets, and Market Design (2018)Research in Operations Management and Information Systems Interface (2018)Some aspects of the sequential design of experiments (1952)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)Using confidence bounds for exploitation-exploration trade-offs (2003)An Empirical Evaluation of Thompson Sampling (2011)Bandits with Knapsacks (2013)Counterfactual Risk Minimization: Learning from Logged Bandit Feedback (2015)Fairness in Learning: Classic and Contextual Bandits (2016)Equilibrium points in n -person games (1950)Potential Games (1996)Algorithmic game theory (2010)Composable and efficient mechanisms (2013)Distributed Welfare Games (2013)Linearly Parameterized Bandits (2010)Combinatorial multi-armed bandit: general framework, results and applications (2013)Reducing Dueling Bandits to Cardinal Bandits (2014)Efficient learning by implicit exploration in bandit problems with side observations (2026)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)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization (2012)Safe Exploration for Optimization with Gaussian Processes (2015)Information-seeking, curiosity, and attention: computational and neural mechanisms (2013)A unified framework for stochastic optimization (2018)Bandit Algorithms (2020)
this work references cited by second hop

References

  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,275 cited
  • 2008Multi-armed bandits in metric spaces353 cited
  • 2009Intrinsic robustness of the price of anarchy333 cited
  • 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits286 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 2014The sample complexity of revenue maximization198 cited
  • 2011From Bandits to Experts: On the Value of Side-Observations167 cited
  • 2015Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design165 cited
  • 2011Reserve prices in internet advertising auctions164 cited
  • 2004Online learning in online auctions158 cited
  • 2017Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium151 cited
  • 2008Regret minimization and the price of total anarchy133 cited
  • 2014Revenue maximization with a single sample116 cited
  • 2014Regret Minimization for Reserve Prices in Second-Price Auctions

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

97 cited

Cited by

No citing works inside the corpus for this window.