SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Minimizing Regret with Multiple Reserves
16 references·1 citing·40 second hop
Minimizing Regret with Multiple Reserves (2016)Minimizing Regret with Multiple ReservesNear-Optimal Online Auctions (2018)Near-Optimal Online AuctionsOn the Pseudo-Dimension of Nearly Optimal Auctions (2015)On the Pseudo-Dimension of Ne…The sample complexity of revenue maximization (2014)The sample complexity of reve…Revenue maximization with a single sample (2014)Revenue maximization with a s…On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)On the Complexity of Best Arm…Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reserve (2013)Learning Theory and Algorithm…A Structural Model of Sponsored Search Advertising Auctions (2011)A Structural Model of Sponsor…Revenue maximization with a single sample (2010)Revenue maximization with a s…Simple versus optimal mechanisms (2009)Simple versus optimal mechani…Algorithmic pricing via virtual valuations (2007)Algorithmic pricing via virtu…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…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…The Price of Truth: Frugality in Truthful Mechanisms (2003)The Price of Truth: Frugality…On approximating optimal auctions (2001)On approximating optimal auct…Optimal Auction Design (1981)Optimal Auction DesignLearning in Auctions: Regret is Hard, Envy is Easy (2016)Learning in Auctions: Regret …Some aspects of the sequential design of experiments (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Non-stochastic Best Arm Identification and Hyperparameter Optimization (2015)Intelligent facial emotion recognition based on stationary wavelet entropy and Jaya algorithm (2017)A unified framework for stochastic optimization (2018)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)Theory of games and economic behavior (2019)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)Auction Theory: A Guide to the Literature (1999)Incentive-compatible online auctions for digital goods (2002)Optimal auctions with correlated bidders are easy (2011)A duality based unified approach to Bayesian mechanism design (2016)The Simple Economics of Optimal Auctions (1989)An algorithmic characterization of multi-dimensional mechanisms (2012)Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization (2012)Recent Developments in the Economics of Price Discrimination (2013)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Bandits with Knapsacks (2013)Auctions Versus Negotiations (1996)A Simple and Approximately Optimal Mechanism for an Additive Buyer (2014)Twenty Lectures on Algorithmic Game Theory (2016)Truth revelation in approximately efficient combinatorial auctions (2002)Mechanism Design via Correlation Gap (2011)Combinatorial Auctions via Posted Prices (2015)Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist when Demands are Interdependent (1985)Robustness in Mechanism Design and Contracting (2019)The AI Economist: Improving Equality and Productivity with AI-Driven Tax Policies (2020)Contributions to the theory of games. (1960)How to use expert advice (1997)Online convex programming and generalized infinitesimal gradient ascent (2003)Algorithms for portfolio management based on the Newton method (2006)Combinatorial bandits (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)
this work references cited by second hop

References

  • 1981Optimal Auction Design5,938 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Models704 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 2009Simple versus optimal mechanisms317 cited
  • 2004The value of knowing a demand curve: bounds on regret for online posted-price auctions296 cited
  • 2007Algorithmic pricing via virtual valuations266 cited
  • 2014The sample complexity of revenue maximization198 cited
  • 2010Revenue maximization with a single sample143 cited
  • 2001On approximating optimal auctions119 cited
  • 2014Revenue maximization with a single sample116 cited
  • 2018Near-Optimal Online Auctions110 cited
  • 2011A Structural Model of Sponsored Search Advertising Auctions106 cited
  • 2003The Price of Truth: Frugality in Truthful Mechanisms93 cited
  • 2015On the Pseudo-Dimension of Nearly Optimal Auctions82 cited
  • 2013Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reserve

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

82 cited

Cited by

  • 2016Learning in Auctions: Regret is Hard, Envy is Easy34 cited