暂无分享,去创建一个
[1] Valentin Robu,et al. Online mechanism design for scheduling non-preemptive jobs under uncertain supply and demand , 2014, AAMAS.
[2] A. V. den Boer,et al. Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions , 2013 .
[3] Jason D. Hartline,et al. Multi-parameter mechanism design and sequential posted pricing , 2009, STOC '10.
[4] Tim Roughgarden,et al. Learning Simple Auctions , 2016, COLT.
[5] Carlo Curino,et al. ERA: A Framework for Economic Resource Allocation for the Cloud , 2017, WWW.
[6] Justin M. Rao,et al. Competition on Price and Quality in Cloud Computing , 2016, WWW.
[7] Yossi Azar,et al. Truthful Online Scheduling with Commitments , 2015, EC.
[8] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[9] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[10] Paul Dütting,et al. Polymatroid Prophet Inequalities , 2013, ESA.
[11] Tuomas Sandholm,et al. Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation , 2003, AAMAS '06.
[12] Ryan Porter,et al. Mechanism design for online real-time scheduling , 2004, EC '04.
[13] Tim Roughgarden,et al. The Pseudo-Dimension of Near-Optimal Auctions , 2015, NIPS 2015.
[14] M. Bagnoli,et al. Log-concave probability and its applications , 2004 .
[15] Joseph Naor,et al. A Truthful Mechanism for Value-Based Scheduling in Cloud Computing , 2013, Theory of Computing Systems.
[16] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[17] Liad Blumrosen,et al. Posted prices vs. negotiations: an asymptotic analysis , 2008, EC '08.
[18] Michal Feldman,et al. Combinatorial Auctions via Posted Prices , 2014, SODA.
[19] Nikhil R. Devanur,et al. Stability of service under time-of-use pricing , 2017, STOC.
[20] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[21] Howard Straubing,et al. Theory of Computing Systems , 2008 .
[22] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[23] 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.