-
4
-
-
29344453190
-
A generalized strategy eliminability criterion and computational methods for applying it
-
Pittsburgh, PA, USA
-
V. Conitzer and T. Sandholm. A generalized strategy eliminability criterion and computational methods for applying it. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 483-488, Pittsburgh, PA, USA, 2005.
-
(2005)
Proceedings of the National Conference on Artificial Intelligence (AAAI)
, pp. 483-488
-
-
Conitzer, V.1
Sandholm, T.2
-
6
-
-
0343391647
-
A proof of the equivalence of the programming problem and the game problem
-
T. Koopmans, editor, John Wiley & Sons
-
G. Dantzig. A proof of the equivalence of the programming problem and the game problem. In T. Koopmans, editor, Activity Analysis of Production and Allocation, pages 330-335. John Wiley & Sons, 1951.
-
(1951)
Activity Analysis of Production and Allocation
, pp. 330-335
-
-
Dantzig, G.1
-
8
-
-
45249127547
-
Nash and correlated equilibria: Some complexity considerations
-
I. Gilboa and E. Zemel. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1:80-93, 1989.
-
(1989)
Games and Economic Behavior
, vol.1
, pp. 80-93
-
-
Gilboa, I.1
Zemel, E.2
-
9
-
-
0003037529
-
Reducibility among combinatorial problems
-
R. E. Miller and J. W. Thatcher, editors, Plenum Press, NY
-
R. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, NY, 1972.
-
(1972)
Complexity of Computer Computations
, pp. 85-103
-
-
Karp, R.1
-
11
-
-
0024030324
-
A note on strategy elimination in bimatrix games
-
D. E. Knuth, C. H. Papadimitriou, and J. N. Tsitsiklis, A note on strategy elimination in bimatrix games. Operations Research Letters, 7(3):103-107, 1988.
-
(1988)
Operations Research Letters
, vol.7
, Issue.3
, pp. 103-107
-
-
Knuth, D.E.1
Papadimitriou, C.H.2
Tsitsiklis, J.N.3
-
12
-
-
0000979731
-
The complexity of two-person zero-sum games in extensive form
-
Oct.
-
D. Koller and N. Megiddo. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior, 4(4):528-552, Oct. 1992.
-
(1992)
Games and Economic Behavior
, vol.4
, Issue.4
, pp. 528-552
-
-
Koller, D.1
Megiddo, N.2
-
13
-
-
0030170957
-
Efficient computation of equilibria for extensive two-person games
-
D. Koller, N. Megiddo, and B. von Stengel. Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior, 14(2):247-259, 1996.
-
(1996)
Games and Economic Behavior
, vol.14
, Issue.2
, pp. 247-259
-
-
Koller, D.1
Megiddo, N.2
Von Stengel, B.3
-
15
-
-
0242624716
-
Playing large games using simple strategies
-
San Diego, CA
-
R. Lipton, E. Markakis, and A. Mehta. Playing large games using simple strategies. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pages 36-41, San Diego, CA, 2003.
-
(2003)
Proceedings of the ACM Conference on Electronic Commerce (ACM-EC)
, pp. 36-41
-
-
Lipton, R.1
Markakis, E.2
Mehta, A.3
-
17
-
-
0004145762
-
-
John Wiley and Sons, New York, Dover republication 1989
-
R. D. Luce and H. Raiffa. Games and Decisions. John Wiley and Sons, New York, 1957. Dover republication 1989.
-
(1957)
Games and Decisions
-
-
Luce, R.D.1
Raiffa, H.2
-
19
-
-
4544335718
-
Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms
-
New York, NY, USA
-
E. Nudelman, J. Wortman, K. Leyton-Brown, and Y. Shoham. Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), New York, NY, USA, 2004.
-
(2004)
International Conference on Autonomous Agents and Multi-agent Systems (AAMAS)
-
-
Nudelman, E.1
Wortman, J.2
Leyton-Brown, K.3
Shoham, Y.4
-
22
-
-
9444249830
-
Simple search methods for finding a Nash equilibrium
-
San Jose, CA, USA
-
R. Porter, E. Nudelman, and Y. Shoham. Simple search methods for finding a Nash equilibrium. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 664-669, San Jose, CA, USA, 2004.
-
(2004)
Proceedings of the National Conference on Artificial Intelligence (AAAI)
, pp. 664-669
-
-
Porter, R.1
Nudelman, E.2
Shoham, Y.3
-
23
-
-
29344453416
-
Mixed-integer programming methods for finding Nash equilibria
-
Pittsburgh, PA, USA
-
T. Sandholm, A. Gilpin, and V. Conitzer. Mixed-integer programming methods for finding Nash equilibria. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 495-501, Pittsburgh, PA, USA, 2005.
-
(2005)
Proceedings of the National Conference on Artificial Intelligence (AAAI)
, pp. 495-501
-
-
Sandholm, T.1
Gilpin, A.2
Conitzer, V.3
-
24
-
-
21244466146
-
Zur Theorie der gesellschaftsspiele
-
J. von Neumann. Zur Theorie der Gesellschaftsspiele. Mathematische Annalen, 100:295-320, 1927.
-
(1927)
Mathematische Annalen
, vol.100
, pp. 295-320
-
-
Von Neumann, J.1
-
26
-
-
33748689631
-
Leadership with commitment to mixed strategies
-
London School of Economics, Feb.
-
B. von Stengel and S. Zamir. Leadership with commitment to mixed strategies. CDAM Research Report LSE-CDAM-2004-01, London School of Economics, Feb. 2004.
-
(2004)
CDAM Research Report LSE-CDAM-2004-01
-
-
Von Stengel, B.1
Zamir, S.2
|