Sciweavers

2 search results - page 1 / 1
» Computing pure nash equilibria in graphical games via markov...
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
JSAC
2008
140views more  JSAC 2008»
13 years 5 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham