J. F. Nash, Jr. Non-cooperative games. Annals of Mathematics, 54(2):286--295, 1951. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Complexity of Computing a Nash Equilibrium - Constantinos Daskalakis Paul Self-citation (Nash) (Correct)
No context found.
J. Nash. "Noncooperative Games," Annals of Mathematics, 54, 289-295, 1951.
The Structure and Complexity of Nash Equilibria.. - Fotakis.. (2002) (7 citations) Self-citation (Nash) (Correct)
No context found.
J. F. Nash, \Non-cooperative Games," Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
Tight Bounds for Worst-Case Equilibria - Artur Czumaj New (Correct)
No context found.
J. F. Nash, Jr. Non-cooperative games. Annals of Mathematics, 54(2):286--295, 1951.
Computing Equilibria in Multi-Player Games - Christos Papadimitriou Tim (Correct)
No context found.
J. F. Nash, Jr. Non-cooperative games. Annals of Mathematics, 54(2):286--295, 1951.
Three-Player Games Are Hard - Constantinos Daskalakis Christos (Correct)
No context found.
J. Nash. "Noncooperative Games," Annals of Mathematics, 54, 289-295, 1951.
Reducibility Among Equilibrium Problems - Paul Goldberg Christos (Correct)
No context found.
J. Nash. "Noncooperative Games", Annals of Mathematics, 54, 289-295, 1951.
The Complexity of Games on Highly Regular Graphs - Exte Nd Ed (Correct)
No context found.
J. Nash "Noncooperative games," Annals of Mathematics, 54, 289--295, 1951.
Unknown - (Correct)
No context found.
J. Nash "Noncooperative games," Annals of Mathematics, 54, 289--295, 1951.
Overcoming Non-stationarity in Uncommunicative Learning - February Un Vers (Correct)
No context found.
J. Nash, \Non-cooperative games," Annals of Mathematics, 54(2):286-295, September 1951.
Correlated-Q Learning - Amy Greenwald Amy (Correct)
No context found.
J. Nash. Non-cooperative games. Annals of Mathematics, 54:286-295, 1951.
Probabilistic Pricebots - Amy Greenwald Department (2000) (3 citations) (Correct)
No context found.
J. Nash. Non-cooperative games. Annals of Mathematics, 54:286-295, 1951.
Best-Response Play In Partially Observable Card Games - Oliehoek, Spaan, Vlassis (2005) (Correct)
No context found.
Nash, J. F. (1951). Non-cooperative games. Annals of Mathematics, 54, 286--295.
Game theory and AI: a unified approach to poker games - Oliehoek (2005) (Correct)
No context found.
J. F. Nash. Non-cooperative games. Annals of Mathematics, 54:286295, 1951.
A Paradox in Optimal Flow Control of M/M/m Queues - Atsushi Inoie Hisao (Correct)
No context found.
J. F. Nash, "Non-cooperative games," Ann. Math., vol. 54, pp. 286-- 295, 1951.
Unknown - Www (Correct)
No context found.
Nash JF. Non-cooperative games. Annals of Mathematics 1951;54:286--95.
Cost Sharing Mechanisms for Fair Pricing of Resources.. - Mavronicolas.. (2005) (Correct)
No context found.
J. F. Nash, "Non-cooperative Games", Annals of Mathematics, Vol. 54, No. 2, pp. 286--295, 1951.
A Cost Mechanism for Fair Pricing of Resource Usage - Mavronicolas, Panagopoulou, .. (2005) (Correct)
No context found.
J. F. Nash, "Non-cooperative Games", Annals of Mathematics, Vol. 54, No. 2, pp. 286--295, 1951.
Non-Cooperative Grids: Game-Theoretic Modeling and Strategy.. - Kwok, Song, Hwang (2004) (Correct)
No context found.
J. F. Nash, Jr., "Non-Cooperative Games," The Annals of Mathematics, Second Series, vol. 54, no. 2, Sept. 1951, pp. 286--295.
Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002) (165 citations) (Correct)
No context found.
J.F. Nash, Non-cooperative games, Ann. Math. 54 (1951) 286--295.
Evolutionary Games: An Algorithmic View - Kontogiannis, Spirakis (Correct)
No context found.
Nash J. F. Noncooperative games. Annals of Mathematics, 54:289--295, 1951.
Market-driven Bandwidth Allocation in Selfish Overlay Networks - Wang, Li (Correct)
No context found.
J. F. Nash, "Non-cooperative games," Annals of Mathematics, vol. 54, pp. 289--295, 1951.
The Role of Reactivity in Multiagent Learning - Bikramjit Banerjee And (2004) (Correct)
No context found.
J. F. Nash. Non-cooperative games. Annals of Mathematics, 54:286 -- 295, 1951.
Planning Algorithms - LaValle (2004) (3 citations) (Correct)
No context found.
J. Nash. Noncooperative games. Ann. of Math., 54(2):286--295, 1951.
Evolutionary Games: What is the algorist's perspective? - Kontogiannis, Spirakis (Correct)
No context found.
Nash J. F. Noncooperative games. Annals of Mathematics, 54:289--295, 1951.
Price of Anarchy for Routing Games with Incomplete Information - Garg, Narahari (Correct)
No context found.
J.F. Nash, "Noncooperative games," Annals of Mathematics, vol. 54, pp. 289--295, 1951.
First 50 documents Next 50
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