Efficient and strategyproof spectrum allocations in multichannel wireless networks

IEEE Transactions on Computers

Volumn 60, Issue 4, 2011, Pages 580-593

  Xu, Ping ^a   Li, Xiang Yang ^a   Tang, Shaojie ^a   Zhao, Jizhong ^b  

^a Illinois Institute of Technology   (United States)

^b XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

approximation; disk graph; interval graph; PTAS; spectrum; strategyproof; Wireless networks

Indexed keywords

APPROXIMATION; DISK GRAPH; INTERVAL GRAPH; PTAS; SPECTRUM; STRATEGY PROOFS;

DISKS (STRUCTURAL COMPONENTS); GAME THEORY; PROFITABILITY; WIRELESS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 79952125380     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2010.241     Document Type: Article

References (27)

1. I. Ahmad and J. Luo, "On Using Game Theory for Perceptually Tuned Rate Control Algorithm for Video Coding," IEEE Trans. Circuits and Systems for Video Technology, vol. 3, no. 2, pp. 202-208, Feb. 2006.
2. R. Bar-Yehuda, M.M. Halldórsson, J.S. Naor, H. Shachnai, and I. Shapira, "Scheduling Split Intervals," Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '02), pp. 732-741, 2002.
3. Y. Bartal, R. Gonen, and N. Nisan, "Incentive Compatible Multi Unit Combinatorial Auctions," Proc. Ninth Conf. Theoretical Aspects of Rationality and Knowledge (TARK '03), pp. 72-87, 2003.
4. P. Briest, P. Krysta, and B. Vöcking, "Approximation Techniques for Utilitarian Mechanism Design," Proc. 37th (Pubitemid 43098570)
5. C. Chekuri and S. Khanna, "A PTAS for the Multiple Knapsack Problem," Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '00), pp. 213-222, 2000.
6. E.H. Clarke, "Multipart Pricing of Public Goods," Public Choice, vol. 11, pp. 17-33, 1971.
7. R.K. Dash and N.R. Jennings, and D.C. Parkes, "Computational- Mechanism Design: A Call to Arms," IEEE Intelligent Systems, vol. 18, no. 6, pp. 40-47, Nov. 2003.
8. T. Groves, "Incentives in Teams," Econometrica, vol. 41, pp. 617- 631, 1973.
9. 1-E"," Acta Mathematica, vol. 182, pp. 105-142, 1999.
10. D.S. Hochbaum and W. Maass, "Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI," J. ACM, vol. 32, pp. 130-136, 1985. (Pubitemid 15599048)
11. K. Jansen and G. Zhang, "On Rectangle Packing: Maximizing Benefits," Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '04), pp. 204-213, 2004.
12. J. Jia and Q. Zhang, and Q. Zhang, and M. Liu, "Revenue Generation for Truthful Spectrum Auction in Dynamic Spectrum Access," Proc. 10th ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 3-12, 2009.
13. M.-Y. Kao, X.-Y. Li, and W. Wang, "Towards Truthful Mechanisms for Binary Demand Games: A General Framework," Proc. ACM Conf. Electronic Commerce, pp. 213-222, 2005. (Pubitemid 43048681)
14. S.U. Khan and I. Almad, "Replicating Date Objects in Large-Scale Distributed Computing Systems Using Extended Vickrey Auction," Int'l J. Computational Intelligence, vol. 3, no. 1, pp. 14-22, 2006.
15. S. Kovaleva, "Improved Dynamic Programming Subroutine in the PTAS for the Unit-Height Rectangle Packing Problem," Proc. APPOL II Workshop, 2002.
16. D.J. Lehmann, L.I. O'Callaghan, and Y. Shoham, "Truth Revelation in Approximately Efficient Combinatorial Auctions," Proc. ACM Conf. Electronic Commerce, pp. 96-102, 1999.
17. R.B. Myerson, "Mechanism Design by an Informed Principal," Econometrica, vol. 51, no. 6, pp. 1767-1797, Nov. 1983.
18. R.B. Myerson, "Mechanism Design," Allocation Information, and Markets, J. Eatwell, M. Milgate, and P. Newman, eds., pp. 191-206, Norton, 1981.
19. N. Nisan and A. Ronen, "Algorithmic Mechanism Design," Proc. Ann. ACM Symp. Theory of Computing (STOC), pp. 129-140, 1999.
20. M.J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 2002.
21. A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos, "An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents," Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '03), 2003.
22. D. Pisinger and P. Toth, "Knapsack Problems," Handbook of Combinatorial Optimization, vol. 1, pp. 299-428, Springer, 1998.
23. S. Sakai, M. Togasaki, and K. Yamazaki, "A Note on Greedy Algorithms for the Maximum Weighted Independent Set Problem," Discrete Applied Math., vol. 126, nos. 2-3, pp. 313-322, 2003.
24. J.A. Stine, "Spectrum Management: The Killer Application of Ad Hoc and Mesh Networking," Proc. IEEE Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Nov. 2005.
25. W. Vickrey, "Counterspeculation, Auctions and Competitive Sealed Tenders," J. Finance, vol. 16, pp. 8-37, 1961.
26. P. Xu and X.-Y. Li, "Online Market Driven Spectrum Scheduling and Auction," Proc. ACM Workshop Cognitive Radio Networks (CoRoNet), 2009.
27. P. Xu and X.-Y. Li, "SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks," Proc. Int'l Symp. Algorithms and Computation (ISAAC), 2009.