Linearly coupled communication games

IEEE Transactions on Communications

Volumn 59, Issue 9, 2011, Pages 2543-2553

  Su, Yi ^a   Van Der Schaar, Mihaela ^a  

^a University of California   (United States)

Author keywords

conjectural equilibrium; Nash equilibrium; non cooperative games; Pareto optimality

Indexed keywords

BELIEF FUNCTION; BEST RESPONSE; GLOBAL CONVERGENCE; MULTIPLE ACCESS; MULTIUSER COMMUNICATION; NASH EQUILIBRIUM; NASH STRATEGY; NON-COOPERATIVE; NONCOOPERATIVE GAME; PARETO BOUNDARY; PARETO-OPTIMALITY; PRICE OF ANARCHY; RANDOM ACCESS; REALISTIC APPLICATIONS; SOLUTION CONCEPTS; UTILITY REGIONS;

ACCESS CONTROL; COMMUNICATION; GAME THEORY; UNCERTAINTY ANALYSIS;

PARETO PRINCIPLE;

EID: 80052918841     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2011.062111.090417     Document Type: Review

References (32)

1. E. Altman, T. Boulogne, R. El-Azouzi, T. Jimenez, and L. Wynter, "A survey on networking games in telecommunications," Computer Operation Research, vol. 33, pp. 286-311, Feb. 2006. (Pubitemid 41068420)
2. A. MacKenzie and S. Wicker, "Game theory and the design of selfconfiguring, adaptive wireless networks," IEEE Commun. Mag., vol. 39, pp. 126-131, Nov. 2001. (Pubitemid 33120695)
3. V. Srivastava, J. Neel, A. MacKenzie, R. Menon, L. A. DaSilva, J. Hicks, J. H. Reed, and R. Gilles, "Using game theory to analyze wireless ad hoc networks," IEEE Commun. Surveys Tutorials, vol. 7, pp. 46-56, 4th quarter, 2005.
4. M. Felegyhazi and J. P. Hubaux, "Game theory in wireless networks: a tutorial," EPFL Technical Report, LCA-REPORT-2006-002, Feb. 2006.
5. R. W. Lucky, "Tragedy of the commons," IEEE Spectrum, vol. 43, no. 1, p. 88, Jan. 2006.
6. D. Yao, "S-modular games with queueing applications," Queueing Syst., vol. 21, pp. 449-475, 1995.
7. E. Altman and Z. Altman, "S-modular games and power control in wireless networks," IEEE Trans. Autom. Control, vol. 48, no. 5, pp. 839-842, May 2003.
8. R. Rosenthal, "A class of games possessing pure-strategy Nash equilibria," International J. Game Theory, vol. 2, pp. 65-67, 1973.
9. G. Scutari, S. Barbarossa, and D. P. Palomar, "Potential games: a framework for vector power control problems with coupled constraints," in Proc. IEEE ICASSP, May 2006.
10. R. Johari and J. N. Tsitsiklis, "Efficiency loss in a network resource allocation game," Mathematics Operations Research, vol. 29, no. 3, pp. 407-435, 2004.
11. T. Roughgarden and E. Tardos, "How bad is selfish routing?" J. ACM, vol. 49, no. 2, pp. 236-259, Mar. 2002.
12. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, "Layering as optimization decomposition," Proc. IEEE, vol. 95, pp. 255-312. Jan. 2007.
13. W. Saad, Z. Han, M. Debbah, A. Hjøungnes, and T. Başar, "Coalitional game theory for communication networks: a tutorial," to be published.
14. Y. Su and M. van der Schaar, "Conjectural equilibrium in multi-user power control games," IEEE Trans. Signal Process., vol. 57, no. 9, pp. 3638-3650, Sep. 2009.
15. Y. Su and M. van der Schaar, "Dynamic conjectures in random access networks using bio-inspired learning," IEEE J. Sel. Areas Commun., vol. 28, no. 4, pp. 587-601, May 2010.
16. Z. Zhang and C. Douligeris, "Convergence of synchronous and asynchronous greedy algorithm in a multiclass telecommunications environment," IEEE Trans. Commun., vol. 40, pp. 1277-1281, 1992. (Pubitemid 23562462)
17. P. Dubey, "Inefficiency of Nash equilibria," Mathematics Operations Research, pp. 1-8, 1986.
18. M. J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 2001.
19. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
20. M. P. Wellman and J. Hu, "Conjectural equilibrium in multiagent learning," Machine Learning, vol. 33, pp. 179-200, 1998. (Pubitemid 128522642)
21. C. Figuières, A. Jean-Marie, N. Quérou, and M. Tidball, Theory of Conjectural Variations. World Scientific Publishing, 2004.
22. C. Douligeris and R. Mazumdar, "A game theoretic perspective to flow control in telecommunication networks," J. Franklin Inst., vol. 329, no. 2, pp. 383-402, 1992.
23. R. La and V. Anantharam, "Utility based rate control in the Internet for elastic traffic," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 271-286, Apr 2002.
24. M. R. Spiegel, Mathematical Handbook of Formulas and Tables. McGraw-Hill, 1968.
25. A. Granas and J. Dugundji, Fixed Point Theory. Springer-Verlag, 2003.
26. F. P. Kelly, "Charging and rate control for elastic traffic," European Trans. Telecommun., vol. 8, pp. 33-37, 1997.
27. J. Lee, M. Chiang, and A. R. Calderbank, "Utility-optimal randomaccess control," IEEE Trans. Wireless Commun., vol. 6, no. 7, pp. 2741-2751, July 2007.
28. K. Kar, S. Sarkar, and L. Tassiulas, "Achieving proportional fairness using local information in ALOHA networks," IEEE Trans. Autom. Control, vol. 49, no. 10, pp. 1858-1862, Oct. 2004.
29. A. H. Mohsenian-Rad, J. Huang, M. Chiang, and V. W. S. Wong, "Utility-optimal random access without message passing," IEEE Trans. Wireless Commun., vol. 8, no. 3, pp. 1073-1079, Mar. 2009.
30. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation. Prentice Hall, 1997.
31. J. Hu, "Learning in Markov games with incomplete information," in Proc. 15th National Conf. Artificial Intelligence. AAAI Press, 1998.
32. Q. Zhu and L. Pavel, "Theory of linear games with constraints and its application to power control of optical networks," in Proc. IEEE INFOCOM, Apr. 2008, pp. 1984-1992.