Spectrum bidding in wireless networks and related

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5092 LNCS, Issue , 2008, Pages 558-567

  Li, Xiang Yang ^a   Xu, Ping ^a   Tang, Shaojie ^a   Chu, Xiaowen ^b  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; GAME THEORY; MACHINE DESIGN; SPECTRUM ANALYSIS;

ASSIGNMENT PROBLEM; COMBINATORICS; EFFICIENT APPROXIMATION ALGORITHMS; INTERNATIONAL CONFERENCES; OPPORTUNISTIC SPECTRUM USAGE; SECONDARY USERS; WIRELESS ACCESS NETWORKS; WIRELESS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 48349096271     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69733-6_55     Document Type: Conference Paper

References (16)

1. 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)
2. Bartal, Y., Gonen, R., Nisan, N.: Incentive Compatible Multi Unit Combinatorial Auctions. In: TARK 2003, pp. 72-87 (2003)
3. Li, X.Y., Xu, P., Tang, S.J., Chu, X.W.: Spectrum Bidding in Wireless Networks and Related. Technical Report, IIT (2008)
4. Briest, P., Krysta, P., Vöcking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: ACM STOC 2005, pp. 39-48 (2005)
5. Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack Problem. In: ACM SODA 2000, pp. 213-222 (2002)
6. Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17-33 (1971)
7. Groves, T.: Incentives in Teams. Econometrica, 617-631 (1973)
8. 1-ε. Acta Mathematica, 105-142 (1999)
9. Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLS. Journal of ACM 32, 130-136 (1985)
10. Jansen, K., Zhang, G.: On Rectangle Packing: Maximizing Benefits. In: ACM SODA 2004, pp. 204-213 (2004)
11. Kovaleva, S.: Improved Dynamic Programming Subroutine in the PTAS for the unit-Height Rectangle Packing Problem. In: APPOL II Workshop (2002)
12. 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)
13. Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (2002)
14. 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)
15. 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)
16. Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8-37 (1961)