Bayesian hierarchical mechanism design for cognitive radio networks

IEEE Journal on Selected Areas in Communications

Volumn 33, Issue 5, 2015, Pages 986-1001

  Xiao, Yong ^a   Han, Zhu ^b   Chen, Kwang Cheng ^c   Dasilva, Luiz A ^d,e  

^a SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^b UNIVERSITY OF HOUSTON   (United States)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^d TRINITY COLLEGE DUBLIN   (Ireland)

^e VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Bayesian game; Cognitive radio; college admission; dynamic spectrum access; forest matching; game theory; hierarchical; mechanism design; stable marriage; stable matching

Indexed keywords

ALGORITHMS; BAYESIAN NETWORKS; COMMERCE; COMPLEX NETWORKS; DYNAMICS; FORESTRY; GAME THEORY; ITERATIVE METHODS; MACHINE DESIGN; SPECTROSCOPY;

BAYESIAN GAME; COLLEGE ADMISSIONS; DYNAMIC SPECTRUM ACCESS; FOREST MATCHING; HIERARCHICAL; MECHANISM DESIGN; STABLE MARRIAGES; STABLE MATCHING;

COGNITIVE RADIO;

ALGORITHMS; INFORMATION RETRIEVAL; RADIO;

EID: 84928737660     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2014.2361092     Document Type: Article

References (48)

1. I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty, "Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey," Comput. Netw., vol. 50, no. 13, pp. 2127-2159, Sep. 2006.
2. D. Lehmann, L. I. O'Callaghan, and Y. Shoham, "Truth revelation in approximately efficient combinatorial auctions," J. ACM, vol. 49, no. 5, pp. 577-602, Sep. 2002.
3. N. Nisan and A. Ronen, "Algorithmic mechanism design," in Proc. 31st Annu. ACM Symp. Theory Comput., Atlanta, GA, USA, May 1999, pp. 129-140.
4. L. Ehlers and J. Massó, "Incomplete information and singleton cores in matching markets," J. Econ. Theory, vol. 136, no. 1, pp. 587-600, Sep. 2007.
5. A. E. Roth, "The evolution of the labor market for medical interns and residents: A case study in game theory," J. Pol. Econ., vol. 92, no. 6, pp. 991-1016, Dec. 1984.
6. Y. Xiao, D. Niyato, Z. Han, and K. C. Chen, "Secondary users entering the pool: A joint optimization framework for spectrum pooling," IEEE J. Sel. Areas Commun., vol. 32, no. 3, pp. 572-588, Mar. 2014.
7. Y. Xiao and L. A. Dasilva, "Dynamic pricing coalitional game for cognitive radio networks," in Proc. IFIP Netw. Workshop HetsNets, Prague, Czech Republic, May 2012, pp. 19-26.
8. Y. Xiao, G. Bi, D. Niyato, and L. A. DaSilva, "A hierarchical game theoretic framework for cognitive radio networks," IEEE J. Sel. Areas Commun., vol. 30, no. 10, pp. 2053-2069, Nov. 2012.
9. D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA, USA: MIT Press, 1991.
10. A. Leshem, E. Zehavi, and Y. Yaffe, "Multichannel opportunistic carrier sensing for stable channel access control in cognitive radio systems," IEEE J. Sel. Areas Commun., vol. 30, no. 1, pp. 82-95, Jan. 2012.
11. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory. Cambridge, U.K.: Cambridge Univ Press, 2007.
12. R. Diestel, Graph Theory. Berlin, Germany: Springer-Verlag, 2005.
13. N. Nie and C. Comaniciu, "Adaptive channel allocation spectrum etiquette for cognitive radio networks," Mobile Netw. Appl., vol. 11, no. 6, pp. 779- 797, Dec. 2006.
14. H. Xu and B. Li, "Resource allocation with flexible channel cooperation in cognitive radio networks," IEEE Trans. Mobile Comput., vol. 12, no. 5, pp. 957-970, May 2013.
15. S. Mathur, L. Sankar, and N. Mandayam, "Coalitions in cooperative wireless networks," IEEE J. Sel. Areas Commun., vol. 26, no. 7, pp. 1104- 1115, Sep. 2008.
16. W. Saad, Z. Han, M. Debbah, and A. Hjorungnes, "A distributed coalition formation framework for fair user cooperation in wireless networks," IEEE Trans. Wireless Commun., vol. 8, no. 9, pp. 4580-4593, Sep. 2009.
17. W. Saad, Z. Han, M. Debbah, A. Hjorungnes, and T. Basar, "Coalitional game theory for communication networks: A tutorial," IEEE Signal Process. Mag., vol. 26, no. 5, pp. 77-97, Sep. 2009.
18. B. Wang, Y. Wu, and K. Liu, "Game theory for cognitive radio networks: An overview," Comput. Netw., vol. 54, no. 14, pp. 2537-2561, Oct. 2010.
19. S. Maharjan, Y. Zhang, and S. Gjessing, "Economic approaches for cognitive radio networks: A survey," Wireless Pers. Commun., vol. 57, no. 1, pp. 33-51, Mar. 2011.
20. Z. Han, D. Niyato, W. Saad, T. Basar, and A. Hjorungnes, Game Theory in Wireless and Communication Networks: Theory, Models, and Applications. Cambridge, U.K.: Cambridge Univ. Press, 2012.
21. M. O. Jackson, "Mechanism theory, optimization, and operations research," in Encyclopedia of Life Support Systems, U. Derigs, Ed. Oxford, U.K.: EOLSS, 2003.
22. B. Wang, Y. Wu, Z. Ji, K. R. Liu, and T. C. Clancy, "Game theoretical mechanism design methods," IEEE Signal Process. Mag., vol. 25, no. 6, pp. 74-84, Nov. 2008.
23. S. Sodagari,A.Attar, and S. Bilen, "Strategies to achieve truthful spectrum auctions for cognitive radio networks based on mechanism design," in Proc. IEEE Symp. New Frontiers DySPAN, Singapore, Apr. 2010, pp. 1-6.
24. A. Gershkov, B. Moldovanu, and X. Shi, "Optimal mechanism design without money," Univ. Toronto, Toronto, ON, Canada, Tech. Rep., 2013.
25. A. D. Procaccia and M. Tennenholtz, "Approximate mechanism design without money,"ACMTrans.Econ. Comput., vol. 1, no. 4, p. 18, Dec. 2013.
26. R. Cole, V. Gkatzelis, and G. Goel, "Positive results for mechanism design without money," in Proc. Int. Conf. Auton. Agents Multi-Agent Syst., 2013, pp. 1165-1166.
27. D. Gusfield and R. W. Irving, The Stable Marriage Problem: Structure and Algorithms. Cambridge, MA, USA: MIT Press, 1989.
28. D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge, U.K.: Cambridge Univ. Press, 2010.
29. R. Jain, "Designing a strategic bipartite matching market," in Proc. IEEE CDC, New Orleans, LA, USA, Dec. 2007, pp. 139-144.
30. A. E. Roth and M. A. O. Sotomayor, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1992.
31. D. E. Knuth, Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms, vol. 10, CRM Proc. Lecture Notes. Providence, RI, USA: AMS, 1997.
32. A. E. Roth, "Deferred acceptance algorithms: History, theory, practice, and open questions," Int. J. Game Theory, vol. 36, no. 3, pp. 537-569, Mar. 2008.
33. K. Iwama, S. Miyazaki, Y. Morita, and D. Manlove, "Stable marriage with incomplete lists and ties," in Proc. 26th ICALP, vol. 1644, ser. Lecture Notes Comput. Sci., Prague, Czech Republic, Jul. 1999, pp. 443-452.
34. R. W. Irving and D. F. Manlove, "The stable roommates problem with ties," J. Algorithms, vol. 43, no. 1, pp. 85-105, Apr. 2002.
35. I. P. Gent and P. Prosser, "An empirical study of the stable marriage problem with ties and incomplete lists," in Proc. 15th ECAI, Jul. 2002, pp. 141-145.
36. K. Iwama and S. Miyazaki, "A survey of the stable marriage problem and its variants," in Proc. IEEE Int. Conf. ICKS, Kyoto, Japan, Jan. 2008, pp. 131-136.
37. A. Al Daoud, T. Alpcan, S. Agarwal, and M. Alanyali, "A stackelberg game for pricing uplink power in wide-band cognitive radio networks," in Proc. IEEE Conf. Decision Control, Cancun, Mexico, Dec. 2008, pp. 1422-1427.
38. M. Razaviyayn, M. Yao, and L. Zhi-Quan, "A Stackelberg game approach to distributed spectrum management," in Proc. IEEE ICASSP, Dallas, TX, USA, Mar. 2010, pp. 3006-3009.
39. Polytechnic University of Madrid, A. F. Cabrera and K. R. Burkum, "College admission criteria in the united states: An overview," Selectividad y Modelos Alternativos, Madrid, Spain, Nov. 2001.
40. K. Apt and A. Witzel, "A generic approach to coalition formation," Int. Game Theory Rev., vol. 11, no. 3, pp. 347-367, Sep. 2009.
41. W. Saad, Z. Han, T. Ba?sar, M. Debbah, and A. Hjorungnes, "Hedonic coalition formation for distributed task allocation among wireless agents," IEEE Trans. Mobile Comput., vol. 10, no. 9, pp. 1327-1344, Sep. 2011.
42. Y. Xiao, K. C. Chen, C. Yuen, and L. A. DaSilva, "Spectrum sharing for device-to-device communications in cellular networks: A game theoretic approach," in Proc. IEEE Int. Symp. New Frontiers DySPAN, Apr. 2014, pp. 60-71.
43. K. Cechl?rov? and T. Fleiner, "On a generalization of the stable roommates problem," ACM Trans. Algorithms, vol. 1, no. 1, pp. 143-156, Jul. 2005.
44. J. J. Tan, "A necessary and sufficient condition for the existence of a complete stable matching," J. Algorithms, vol. 12, no. 1, pp. 154-178, Mar. 1991.
45. P. Biró and G. Norman, "Analysis of stochastic matching markets," Int. J. Game Theory, vol. 42, no. 4, pp. 1021-1040, Nov. 2013.
46. T. Fleiner, "A fixed-point approach to stable matchings and some applications," Math. Oper. Res., vol. 28, no. 1, pp. 103-126, Feb. 2003.
47. J.W. Hatfield and P. R. Milgrom, "Matching with contracts," Amer. Econ. Rev., vol. 95, no. 4, pp. 913-935, Sep. 2005.
48. A. Goldsmith, Wireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2005.