Online auctions with re-usable goods
暂无分享,去创建一个
Mohammad Taghi Hajiaghayi | David C. Parkes | Mohammad Mahdian | Robert D. Kleinberg | D. Parkes | Mohammad Mahdian | M. Hajiaghayi
[1] I. Mazin,et al. Theory , 1934 .
[2] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[3] Noam Nisan,et al. Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.
[4] Bruce Hajek. On the Competitiveness of On-Line Scheduling of Unit-Length Packets with Hard Deadlines in Slotted Time , 2001 .
[5] Sven de Vries,et al. Linear Programming and Vickrey Auctions , 2001 .
[6] Boaz Patt-Shamir,et al. Buffer overflow management in QoS switches , 2001, STOC '01.
[7] Brenda L Dietrich,et al. Mathematics of the internet : e-auction and markets , 2002 .
[8] Vijay Kumar,et al. Online learning in online auctions , 2003, SODA '03.
[9] Kunal Talwar,et al. The Price of Truth: Frugality in Truthful Mechanisms , 2003, STACS.
[10] Noam Nisan,et al. Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[11] Margo I. Seltzer,et al. Virtual worlds: fast and strategyproof auctions for dynamic resource allocation , 2003, EC '03.
[12] Eric J. Friedman,et al. Pricing WiFi at Starbucks: issues in online mechanism design , 2003, EC '03.
[13] Francis Y. L. Chin,et al. Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? , 2003, Algorithmica.
[14] 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..
[15] David C. Parkes,et al. An MDP-Based Approach to Online Mechanism Design , 2003, NIPS.
[16] Yossi Azar,et al. Reducing truth-telling online mechanisms to online optimization , 2003, STOC '03.
[17] Mohammad Taghi Hajiaghayi,et al. Adaptive limited-supply online auctions , 2004, EC '04.
[18] David C. Parkes,et al. Approximately Efficient Online Mechanism Design , 2004, NIPS.
[19] Marek Chrobak,et al. Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs , 2004, STACS.
[20] Ryan Porter,et al. Mechanism design for online real-time scheduling , 2004, EC '04.
[21] Noam Nisan,et al. Online ascending auctions for gradually expiring items , 2005, SODA '05.
[22] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.