To preempt or not: Tackling bid and time-based cheating in online spectrum auctions

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 2219-2227

  Deek, Lara ^a   Zhou, Xia ^a   Almeroth, Kevin ^a   Zheng, Haitao ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACROSS TIME; ARRIVAL TIME; BIDDING MODELS; BIN PACKING; CRITICAL VALUE; DECISION TIME; MINIMUM COST; ON-THE-FLY; SPECTRUM ALLOCATION; SPECTRUM AUCTIONS; SPECTRUM UTILIZATION;

COMMERCE; COMPUTER SIMULATION; ECONOMICS; VANADIUM COMPOUNDS;

TOPAZ;

EID: 79960851161     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935036     Document Type: Conference Paper

References (25)

1. J. Jia, Q. Zhang, Q. Zhang, and M. Liu, "Revenue generation for truthful spectrum auction in dynamic spectrum access," in MobiHoc, 2009.
2. S. Gandhi et al., "A general framework for wireless spectrum auctions," in DySPAN, 2007.
3. X. Zhou et al., "eBay in the sky: Strategy-proof wireless spectrum auctions," in MobiCom, 2008.
4. X. Zhou and H. Zheng, "TRUST: A general framework for truthful double spectrum auctions." in INFOCOM, 2009.
5. M. T. Hajiaghayi, R. D. Kleinberg, and M. Mahdian, "Online auctions with re-usable goods," in Electronic Commerce, 2005.
6. R. Lavi and N. Nisan, "Online ascending auctions for gradually expiring items," in Symposium on Discrete Algorithms, 2005.
7. P. Xu and X.-Y. Li, "Online market driven spectrum scheduling and auction," in ACM Workshop on Cognitive Radio Networks, 2009.
8. P. Xu, S. Wang, and X.-Y. Li, "SALSA: Strategyproof online spectrum admissions for wireless networks," IEEE Transactions on Computers, vol. 99, no. PP, pp. 1-1, 2010.
9. T. R. E. T. Noam Nisan and V. V. Vazirani, Eds., Algorithmic Game Theory. Cambridge University Press, 2007.
10. R. Lavi, A. Mu'alem, and N. Nisan, "Towards a characterization of truthful combinatorial auctions," in Foundations of Computer Science, 2003.
11. N. Ahmed, U. Ismail, and S. Kashav, "Online estimation of RF interference," in CoNEXT, 2008.
12. D. Niculescu, "Interference map for 802.11 networks," in IMC, 2007.
13. T. Groves, "Incentive in terms," Econometrica, vol. 41, pp. 617-631, 1973.
14. E. Clarke, "Multipart pricing of public goods," Public Choice, vol. 11, pp. 17-33, 1971.
15. W. Vickery, "Counterspeculation, auctions and competitive sealed tenders," Journal of Finance, vol. 16, pp. 8-37, 1961.
16. R. L. Graham et al., "Optimization and approximation in deterministic sequencing and scheduling: A survey," in Discrete Optimization II, 1979, pp. 287-326.
17. X. Zhou and H. Zheng, "Breaking bidder collusion in large-scale spectrum auctions," in MobiHoc, 2010.
18. A. Takefusa et al., "A study of deadline scheduling for client-server systems on the computational grid," in High Performance Distributed Computing, 2001.
19. E. Caron, P. K. Chouhan, and F. Desprez, "Deadline scheduling with priority for client-server systems on the grid," in IEEE/ACM Workshop on Grid Computing, 2004.
20. T. Hey, Ed., Grid Computing: Making the Global Infrastructure a Reality. John Wiley & Sons, Inc., 2003.
21. I. Foster and C. Kesselman, The Grid 2: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers Inc., 2003.
22. M. Maheswaran et al., "Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems," in IEEE Workshop on Heterogeneous Computing, 1999.
23. D. A. Menascé et al., "Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures," Journal of Parallel and Distributed Computing, vol. 28, no. 1, pp. 1-18, 1995.
24. C. Liu and S. Baskiyar, "Scheduling mixed tasks with deadlines in grids using bin packing," in ICPADS, 2008.
25. J.-K. Kim et al., "Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment," Journal of Parallel and Distributed Computing, vol. 67, no. 2, pp. 154-169, 2007.