Ai, X., Srinivasan, V., & Tham, C. (2008). Optimality and Complexity of Pure Nash Equilibria in the Coverage Game. IEEE journal on selected areas in communications, 26(7), 1170-1182. https://doi.org/10.1109/JSAC.2008.080914
Chicago-Zitierstil (17. Ausg.)Ai, Xin, V. Srinivasan, und Chen-khong Tham. "Optimality and Complexity of Pure Nash Equilibria in the Coverage Game." IEEE Journal on Selected Areas in Communications 26, no. 7 (2008): 1170-1182. https://doi.org/10.1109/JSAC.2008.080914.
MLA-Zitierstil (9. Ausg.)Ai, Xin, et al. "Optimality and Complexity of Pure Nash Equilibria in the Coverage Game." IEEE Journal on Selected Areas in Communications, vol. 26, no. 7, 2008, pp. 1170-1182, https://doi.org/10.1109/JSAC.2008.080914.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.