Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An approximate truthful mechanism for combinatorial auctions with single parameter agents
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
Pricing of spectrum reservation under overbooking
Electronic Commerce Research and Applications
Hi-index | 0.01 |
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.