Optimality and complexity of pure nash equilibria in the coverage game

IEEE Journal on Selected Areas in Communications

Volumn 26, Issue 7, 2008, Pages 1170-1182

  Ai, Xin ^a,b   Srinivasan, Vikram ^a,c   Tham, Chen Khong ^a,b  

^a IEEE

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Coverage; Game theory; Wireless sensor networks

Indexed keywords

COVERAGE; PURE NASH EQUILIBRIA;

CHLORINE COMPOUNDS; COMPUTER NETWORKS; CONGESTION CONTROL (COMMUNICATION); DECISION MAKING; SENSOR NETWORKS; SENSORS; SET THEORY; WIRELESS SENSOR NETWORKS;

GAME THEORY;

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

References (21)

1. X. Ai, V. Srinivasan, and C. K. Tham, "Darco: Distributed, robust and asynchronous coverage in wireless sensor networks," IEEE, SECON, 2007.
2. M. Cardei, M. T.Thai, Y. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," IEEE INFOCOM, 2005.
3. S. Slijepcevic and M. Potkonjak, "Power efficient organization, of wireless sensor networks," ICC, 2001.
4. H. Zhang and J. C. Hou, "Maximizing a-lifetime for wireless sensor networks," SenMetrics, 2005.
5. Z. Abrams, A. Goel, and S. Plotkin, "Set k-cover algorithms for energy efficient monitoring in wireless sensor networks," Information Processing In Sensor Networks (IPSN), Apr. 2004.
6. D. K. David Vickrey, "Multi-agent algorithm for solving graphical games," AAAI, 2002.
7. D. Monderer and L. Shapley, "Potential games," GAMES AND ECONOMIC BEHAVIOR, pp. 124-143, 1996.
8. J. Nash, "Equilibrium points in n-person games," PNAS, 1950.
9. C. H. Papadimitriou, "How easy is local search?," Journal of computer and system sciences 37,79-100, 1988.
10. H. Zhang and J. C. Hou, "On the upper bound of α-lifetime for large sensor network," ACM Transactions on Sensor Networks, 2005.
11. S. S. Micheal Kearns, Michael L. Littman, "Graphical models for game theory," PCUAI, 2001.
12. D.Fudenberg and J.Tirole, "Game theory," MIT Press, 1991.
13. X. Ai, V. Srinivasan, and C. K. Tham, "Coverage game in wireless sensor networks," ICON, Sept. 2006.
14. H. Zhang and J. Hou, "Maintaining sensing coverage and connectivity in sensor networks," Ad Hoc & Sensor Wireless Networks, Vol. 1, pp. 89-124, Mar. 2005.
15. E.Koutsoupias and C. Papadimitriou, "Worst-case equilibria," Proceedings 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404-413.
16. A. Vetta, "Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions," Annual IEEE Symposium on Foundations of Computer Science, pp. 416-425.
17. T. Roughgarden and E.Tardos, "How bad is selfish routing?," Journal of the ACM, pp. 49(2):236-259.
18. B.Vocking and R. Aachen, "Congestion games: optimization in competition," ACiD, 2006.
19. M.W.Krentel, "Structure in locally optimal solutions," Proc. IEEE FOCS, 1989.
20. A. Fabrikant, C. Papadimitriou, and K. Talwar, "The complexity of pure rush equilibria," STOC, 2004.
21. A. A. Schaffer and M. Yannakakis, "Simple loal selocal problems that are hard to solve," SIAM (Society for Industrial and Applied Mathematics) journal of computing, Vol.20, No1., pp. 56-87, Feb. 1991.