Online Frequency Allocation and Mechanism Design for Cognitive Radio Wireless Networks

[1]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

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

[3]  Yunnan Wu,et al.  Allocating dynamic time-spectrum blocks in cognitive radio networks , 2007, MobiHoc '07.

[4]  Shaojie Tang,et al.  Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks , 2011, IEEE Transactions on Computers.

[5]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[6]  Mike S. Paterson.  Algorithms - ESA 2000 , 2003, Lecture Notes in Computer Science.

[7]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Yu Wang,et al.  Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks , 2006, J. Parallel Distributed Comput..

[9]  David P. Williamson,et al.  A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , 2000, Oper. Res. Lett..

[10]  Francis Y. L. Chin,et al.  Laxity Helps in Broadcast Scheduling , 2005, ICTCS.

[11]  Jon Feldman,et al.  An online mechanism for ad slot reservations with cancellations , 2009, SODA.

[12]  Cynthia A. Phillips,et al.  Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.

[13]  Susanne Albers,et al.  Better bounds for online scheduling , 1997, STOC '97.

[14]  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..

[15]  Marek Chrobak,et al.  Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help , 2007, SIAM J. Comput..

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[18]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[19]  Petros Koumoutsakos,et al.  Learning probability distributions in continuous evolutionary algorithms – a comparative review , 2004, Natural Computing.

[20]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[21]  Michel X. Goemans,et al.  A Supermodular Relaxation for Scheduling with Release Dates , 1996, IPCO.

[22]  David R. Karger,et al.  A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[23]  Han Hoogeveen,et al.  Preemptive Scheduling with Rejection , 2000, ESA.

[24]  Gerhard J. Woeginger,et al.  On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..

[25]  Xia Zhou,et al.  TRUST: A General Framework for Truthful Double Spectrum Auctions , 2009, IEEE INFOCOM 2009.

[26]  Éva Tardos,et al.  An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.

[27]  Xia Zhou,et al.  eBay in the Sky: strategy-proof wireless spectrum auctions , 2008, MobiCom '08.

[28]  Xiang-Yang Li,et al.  TOFU: Semi-Truthful Online Frequency Allocation Mechanism for Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[29]  Anat Bremler-Barr,et al.  On the exploitation of CDF based wireless scheduling , 2013, Comput. Networks.

[30]  Xiang-Yang Li,et al.  Online market driven spectrum scheduling and auction , 2009, CoRoNet '09.

[31]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[32]  Han Hoogeveen,et al.  On-line scheduling on a single machine: maximizing the number of early jobs , 2000, Oper. Res. Lett..

[33]  F Thomas Bruss.  A Unified Approach to a Class of Best Choice Problems with an Unknown Number of Options , 1984 .

[34]  Yuan Wu,et al.  Distributed Multichannel Power Allocation Algorithm for Spectrum Sharing Cognitive Radio Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[35]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[36]  Rudolf Fleischer,et al.  On‐line scheduling revisited , 2000 .

[37]  Yin-Feng Xu,et al.  On-line production order scheduling with preemption penalties , 2007, J. Comb. Optim..

[38]  Xiang-Yang Li,et al.  SALSA: Strategyproof Online Spectrum Admissions for Wireless Networks , 2010, IEEE Transactions on Computers.

[39]  Xiang-Yang Li,et al.  SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks , 2009, ISAAC.

[40]  Shaojie Tang,et al.  Spectrum Bidding in Wireless Networks and Related , 2008, COCOON.

[41]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[42]  Ramaswamy Chandrasekaran,et al.  Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..