Sciweavers

Share
3 search results - page 1 / 1
» A new proof of Nash's Theorem via exchangeable equilibria
Sort
View
CORR
2010
Springer
104views Education» more  CORR 2010»
11 years 5 months ago
A new proof of Nash's Theorem via exchangeable equilibria
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
11 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
CORR
2008
Springer
107views Education» more  CORR 2008»
11 years 5 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
books