Adaptive limited-supply online auctions
暂无分享,去创建一个
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[3] F. Mosteller,et al. Recognizing the Maximum of a Sequence , 1966 .
[4] Robert J. Vanderbei. The Optimal Choice of a Subset of a Population , 1980, Math. Oper. Res..
[5] Kenneth S. Glasser,et al. The d-Choice Secretary Problem. , 1983 .
[6] John G. Wilson. Optimal choice and assignment of the best m of n randomly arriving items , 1991 .
[7] Nimrod Megiddo,et al. Improved algorithms and analysis for secretary problems and generalizations , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[8] Noam Nisan,et al. Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.
[9] Andrew V. Goldberg,et al. Competitive auctions and digital goods , 2001, SODA '01.
[10] Vijay Kumar,et al. Online learning in online auctions , 2003, SODA '03.
[11] Eric J. Friedman,et al. Pricing WiFi at Starbucks: issues in online mechanism design , 2003, EC '03.
[12] 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..
[13] David C. Parkes,et al. An MDP-Based Approach to Online Mechanism Design , 2003, NIPS.
[14] Yossi Azar,et al. Reducing truth-telling online mechanisms to online optimization , 2003, STOC '03.
[15] Jérémie Gallien,et al. Sloan School of Management Working Paper 4268-02 December 2002 Dynamic Mechanism Design for Online Commerce , 2002 .