Abstract
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the selfish behavior of secondary users. In order to improve opportunistic spectrum usage, we propose to combine the game theory with wireless modeling. Several versions of problems are formalized under different assumptions. We design PTAS or efficient approximation algorithms for each of these problems such that overall social benefit is maximized. Finally, we show how to design a truthful mechanism based on all these algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Halldórsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling Split Intervals. In: ACM SODA 2002, pp. 732–741 (2002)
Bartal, Y., Gonen, R., Nisan, N.: Incentive Compatible Multi Unit Combinatorial Auctions. In: TARK 2003, pp. 72–87 (2003)
Li, X.Y., Xu, P., Tang, S.J., Chu, X.W.: Spectrum Bidding in Wireless Networks and Related. Technical Report, IIT (2008)
Briest, P., Krysta, P., Vöcking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: ACM STOC 2005, pp. 39–48 (2005)
Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack Problem. In: ACM SODA 2000, pp. 213–222 (2002)
Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17–33 (1971)
Groves, T.: Incentives in Teams. Econometrica, 617–631 (1973)
Hastad, J.: Clique is Hard to Approximate within n 1 − ε. Acta Mathematica, 105–142 (1999)
Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLS. Journal of ACM 32, 130–136 (1985)
Jansen, K., Zhang, G.: On Rectangle Packing: Maximizing Benefits. In: ACM SODA 2004, pp. 204–213 (2004)
Kovaleva, S.: Improved Dynamic Programming Subroutine in the PTAS for the unit-Height Rectangle Packing Problem. In: APPOL II Workshop (2002)
Lehmann, D.J., O’Callaghan, L.I., Shoham, Y.: Truth Revelation in Approximately Efficient Combinatorial Auctions. In: ACM Conf. on Electronic Comm, pp. 96–102 (1999)
Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (2002)
Papadimitriou, A.A.C., Talwar, K., Tardos, E.: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. In: ACM SODA 2003, pp. 205–214 (2003)
Stine, J.A.: Spectrum Management: The Killer Application of ad hoc and Mesh Networking. In: IEEE Symp. on New Frontiers in Dynamic Spectrum Access Net (2005)
Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, XY., Xu, P., Tang, S., Chu, X. (2008). Spectrum Bidding in Wireless Networks and Related. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)