TOFU: Semi-Truthful Online Frequency Allocation Mechanism for Wireless Networks
暂无分享,去创建一个
[1] Dennis Shasha,et al. D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..
[2] David P. Williamson,et al. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , 2000, Oper. Res. Lett..
[3] Xiang-Yang Li,et al. SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks , 2009, ISAAC.
[4] Shaojie Tang,et al. Spectrum Bidding in Wireless Networks and Related , 2008, COCOON.
[5] Cynthia A. Phillips,et al. Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.
[6] J.A. Stine. Spectrum management: the killer application of ad hoc and mesh networking , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..
[7] Han Hoogeveen,et al. Preemptive scheduling with rejection , 2000, Math. Program..
[8] Gerhard J. Woeginger,et al. On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..
[9] XiaoHua Xu,et al. TODA: Truthful Online Double Auction for Spectrum Allocation in Wireless Networks , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).
[10] Yu Wang,et al. Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks , 2006, J. Parallel Distributed Comput..
[11] Leen Stougie,et al. Multiprocessing scheduling with rejection. Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (SODA), January 28-30, Atlanta, Georgia, USA, 1996 , 1996 .
[12] Jon Feldman,et al. An online mechanism for ad slot reservations with cancellations , 2009, SODA.
[13] Ramaswamy Chandrasekaran,et al. Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..
[14] Leen Stougie,et al. Multiprocessor scheduling with rejection , 1996, SODA '96.
[15] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[16] Han Hoogeveen,et al. On-line scheduling on a single machine: maximizing the number of early jobs , 2000, Oper. Res. Lett..
[17] Marek Chrobak,et al. Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help , 2004, ICALP.
[18] Yunnan Wu,et al. Allocating dynamic time-spectrum blocks in cognitive radio networks , 2007, MobiHoc '07.
[19] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[20] Shaojie Tang,et al. Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks , 2011, IEEE Transactions on Computers.
[21] Xia Zhou,et al. TRUST: A General Framework for Truthful Double Spectrum Auctions , 2009, IEEE INFOCOM 2009.
[22] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.
[23] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.
[24] Rudolf Fleischer,et al. On‐line scheduling revisited , 2000 .
[25] Yin-Feng Xu,et al. On-line production order scheduling with preemption penalties , 2007, J. Comb. Optim..
[26] Xia Zhou,et al. eBay in the Sky: strategy-proof wireless spectrum auctions , 2008, MobiCom '08.
[27] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[28] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[29] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[30] Sanjoy K. Baruah,et al. On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.