V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. TR CMU-CS-02-135. Carnegie-Mellon U., 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
AWESOME: A General Multiagent Learning Algorithm that.. - Conitzer, Sandholm (2006) (1 citation) Self-citation (Conitzer Sandholm) (Correct)
No context found.
Conitzer, V., & Sandholm, T. (2003b). Complexity results about Nash equilibria. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI) (pp. 765--771). Acapulco, Mexico.
Complexity of (Iterated) Dominance - Vincent Conitzer Forbes Self-citation (Conitzer Sandholm) (Correct)
No context found.
Vincent Conitzer and Tuomas Sandholm. Complexity results about Nash equilibria. In IJCAI, pages 765--771, 2003.
Computational Aspects of Mechanism Design - Conitzer (2005) Self-citation (Conitzer) (Correct)
No context found.
Conitzer, V., and Sandholm, T. 2003e. Complexity results about Nash equilibria. IJCAI, 765--771.
BL-WoLF: A Framework For Loss-Bounded Learnability In.. - Vincent Conitzer Conitzer (2003) Self-citation (Conitzer Sandholm) (Correct)
No context found.
Conitzer, V., & Sandholm, T. (2003). Complexity results about Nash equilibria. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI). Acapulco, Mexico. Earlier version appeared as technical report CMU-CS-02-135.
Mixed-Integer Programming Methods for Finding Nash Equilibria - Sandholm, Gilpin, Conitzer (2005) Self-citation (Conitzer Sandholm) (Correct)
No context found.
Conitzer, V., and Sandholm, T. 2003. Complexity results about Nash equilibria. In IJCAI-03, 765--771.
Computing the Optimal Strategy to Commit to - Vincent Conitzer Computer Self-citation (Conitzer Sandholm) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), pages 765--771, Acapulco, Mexico, 2003.
A Generalized Strategy Eliminability Criterion and.. - Conitzer, Sandholm (2005) Self-citation (Conitzer Sandholm) (Correct)
No context found.
Conitzer, V., and Sandholm, T. 2003. Complexity results about Nash equilibria. In IJCAI, 765--771.
Complexity of Iterated Dominance and a New - Definition Of Eliminability Self-citation (Conitzer Sandholm) (Correct)
No context found.
Vincent Conitzer and Tuomas Sandholm. Complexity results about Nash equilibria. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), 2003.
Computing Equilibria for Congestion Games - With Im Perfect (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. TR CMU-CS-02-135. Carnegie-Mellon U., 2002.
Computing Equilibria in Multi-Player Games - Christos Papadimitriou Tim (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proceedings of International Joint Conference on Artificial Intelligence, 2003.
The Complexity of Pure Nash Equilibria - Alex Fabrikant Christos (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about nash equilibria. In Proc. of IJCAI, pages 765-771, 2003.
The Complexity of Computing a Nash Equilibrium - Constantinos Daskalakis Paul (Correct)
No context found.
V. Conitzer and T. Sandholm. "Complexity Results about Nash Equilibria," Proceedings of 18th IJCAI, pp. 765-771, Acapulco, Mexico, 2003.
Max-Min Fair Allocation of Indivisible - Goods Daniel Golovin (2005) (Correct)
No context found.
Vincent Conitzer and Tuomas Sandholm. Complexity results about Nash equilibria. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pages 765--771, 2003.
Solution Sets in DCOPs and Graphical Games: Metrics and.. - Pearce, Maheswaran, Tambe (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In IJCAI, 2003.
On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In IJCAI 03: International Joint Conference on Arti cial Intelligence, pages 765-771, 2003.
CS 294-5 Algorithmic Aspects of the Internet - Instructor Christos Papadimitriou (Correct)
No context found.
Conitzer, Sandholm. Complexity Results about Nash Equilibria. IJCAI 2003.
Performance Management in Competitive Distributed Web Search - Khoussainov, Kushmerick (2003) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. Technical Report CMU-CS-02-135, Carnegie Mellon University, 2002.
Computing Equilibria in Multi-Player Games - Papadimitriou, Roughgarden (2004) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proceedings of International Joint Conference on Artificial Intelligence, 2003.
Run the GAMUT: A Comprehensive Approach To.. - Nudelman.. (2004) (2 citations) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In IJCAI, 2003.
Run the GAMUT: A Comprehensive Approach To.. - Nudelman.. (2004) (2 citations) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In IJCAI, 2003.
Automated Index Management for Distributed Web Search - Khoussainov, Kushmerick (2003) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proc. of the 18th Intl. Joint Conf. on AI, 2003.
The Complexity of Pure Nash Equilibria - Fabrikant, Papadimitriou, Talwar (2004) (7 citations) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about nash equilibria. In Proc. of IJCAI, pages 765-771, 2003.
A Polynomial-time Nash Equilibrium Algorithm for Repeated Games - Littman, Stone (2004) (7 citations) (Correct)
No context found.
Vincent Conitzer and Tuomas Sandholm. Complexity results about Nash equilibria. In Proceedings of the 18th International Joint Conference on Arti cial Intelligence (IJCAI-03), pages 765-771, 2003.
Concepts of Optimal Utterance in Dialogue: Selection and.. - Dunne, McBurney (2003) (1 citation) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. Technical Report CMU-CS-02-135, School of Computer Science, Carnegie-Mellon University, May 2002.
Playing Large Games using Simple Strategies - Lipton, Markakis, Mehta (2003) (10 citations) (Correct)
No context found.
V. Conitzer and T. Sandholm. Complexity results about nash equilibria. In International Joint Conference on Artificial Intelligence, 2003.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC