Author:
Naumov Pavel,Protzman Margaret
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference16 articles.
1. Daskalakis C. Papadimitriou C. H. Proceedings of the 7th ACM Conference on Electronic Commerce. New York, NY, USA: ACM; 2006. Computing pure Nash equilibria in graphical games via Markov random fields; p. 91-99. EC ’06.
2. Dilkina B. Gomes C. P. Sabharwal A. The impact of network topology on pure Nash equilibria in graphical games. In: Cohn A. , editor. Proceedings of the 22nd National Conference on Artificial Intelligence - Volume 1 (AAAI'07). AAAI Press; 2007. p. 42-49.
3. Axioms and algorithms for inferences involving probabilistic independence
4. Gottlob G. Greco G. Scarcello F. Pure Nash equilibria: hard and easy games. In: Tennenholtz M. , editor. Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK ’03). New York, NY, USA: ACM; 2003. p. 215-230.
5. Harjes K. Naumov P. Cellular games, Nash equilibria, and Fibonacci numbers. In: Grossi D. Roy O. Huang H. , editors. The Fourth International Workshop on Logic, Rationality and Interaction (LORI-IV). Springer; 2013. p. 149-161.