Spectrum Bidding in Wireless Networks and Related
暂无分享,去创建一个
Shaojie Tang | Xiang-Yang Li | Ping Xu | Xiaowen Chu | Xiaowen Chu | Xiangyang Li | Shaojie Tang | Ping Xu
[1] Noam Nisan,et al. Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.
[2] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[3] Éva Tardos,et al. An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.
[4] E. H. Clarke. Multipart pricing of public goods , 1971 .
[5] Theodore Groves,et al. Incentives in Teams , 1973 .
[6] Klaus Jansen,et al. On rectangle packing: maximizing benefits , 2004, SODA '04.
[7] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[8] Reuven Bar-Yehuda,et al. Scheduling split intervals , 2002, SODA '02.
[9] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[10] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[11] Berthold Vöcking,et al. Approximation techniques for utilitarian mechanism design , 2005, STOC '05.
[12] H. Shachnai,et al. Scheduling Split Intervals Reuven Bar-Yehuda yz Magn us M. Halld orsson x Joseph (Se) Naor y , 2005 .
[13] Sanjeev Khanna,et al. A PTAS for the multiple knapsack problem , 2000, SODA '00.
[14] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[15] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[16] 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..