Online revenue maximization for server pricing

[1]  The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization , 2021, J. ACM.

[2]  Stefano Leonardi,et al.  A Regret Analysis of Bilateral Trade , 2021, EC.

[3]  S. Leonardi,et al.  Efficient two-sided markets with limited information , 2020, STOC.

[4]  Chenghao Guo,et al.  Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem , 2019, COLT.

[5]  Éva Tardos,et al.  Stability and Learning in Strategic Queuing Systems , 2020, EC.

[6]  The Competitive Effects of Variance-based Pricing , 2020, IJCAI.

[7]  Sven Seuken,et al.  Cloud Pricing: The Spot Market Strikes Back , 2019, EC.

[8]  Peter Key,et al.  Simple Pricing Schemes for the Cloud , 2017, ACM Trans. Economics and Comput..

[9]  S. Matthew Weinberg,et al.  The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[10]  Peter Key,et al.  Optimal Pricing and Introduction Timing of Improving Technologies , 2018 .

[11]  Xiaoyong Tang,et al.  Budget‐constraint stochastic task scheduling on heterogeneous cloud systems , 2017, Concurr. Comput. Pract. Exp..

[12]  Nikhil R. Devanur,et al.  Stability of service under time-of-use pricing , 2017, STOC.

[13]  Carlo Curino,et al.  ERA: A Framework for Economic Resource Allocation for the Cloud , 2017, WWW.

[14]  Tim Roughgarden,et al.  Learning Simple Auctions , 2016, COLT.

[15]  Justin M. Rao,et al.  Competition on Price and Quality in Cloud Computing , 2016, WWW.

[16]  Ian A. Kash,et al.  Pricing the Cloud , 2016, IEEE Internet Computing.

[17]  Yossi Azar,et al.  Truthful Online Scheduling with Commitments , 2015, EC.

[18]  Tim Roughgarden,et al.  The Pseudo-Dimension of Near-Optimal Auctions , 2015, NIPS 2015.

[19]  Michal Feldman,et al.  Combinatorial Auctions via Posted Prices , 2014, SODA.

[20]  Paul Dütting,et al.  Polymatroid Prophet Inequalities , 2013, ESA.

[21]  Tim Roughgarden,et al.  On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.

[22]  Richard Cole,et al.  The sample complexity of revenue maximization , 2014, STOC.

[23]  Valentin Robu,et al.  Online mechanism design for scheduling non-preemptive jobs under uncertain supply and demand , 2014, AAMAS.

[24]  A. V. den Boer,et al.  Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions , 2013 .

[25]  Aleksandrs Slivkins,et al.  Bandits with Knapsacks , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[26]  Joseph Naor,et al.  A Truthful Mechanism for Value-Based Scheduling in Cloud Computing , 2013, Theory of Computing Systems.

[27]  S. Matthew Weinberg,et al.  Matroid prophet inequalities , 2012, STOC '12.

[28]  Shuchi Chawla,et al.  Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.

[29]  Sherwood C. Frey,et al.  Auctions , 2009, SSRN Electronic Journal.

[30]  Daniel Grosu,et al.  An Incentive-Compatible Mechanism for Scheduling Non-Malleable Parallel Jobs with Individual Deadlines , 2008, 2008 37th International Conference on Parallel Processing.

[31]  Liad Blumrosen,et al.  Posted prices vs. negotiations: an asymptotic analysis , 2008, EC '08.

[32]  Howard Straubing,et al.  Theory of Computing Systems , 2008 .

[33]  Tuomas Sandholm,et al.  Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation , 2003, AAMAS '06.

[34]  Ryan Porter,et al.  Mechanism design for online real-time scheduling , 2004, EC '04.

[35]  M. Bagnoli,et al.  Log-concave probability and its applications , 2004 .

[36]  Frank Thomson Leighton,et al.  The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[37]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[38]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[39]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[40]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .