-
5
-
-
0036568025
-
Finite-time analysis of the multiarmed bandit problem
-
DOI 10.1023/A:1013689704352, Computational Learning Theory
-
P. Auer, N. Cesa-Bianchi, and P. Fischer Finite-time analysis of the multiarmed bandit problem Machine Learning 47 2002 235 256 (Pubitemid 34126111)
-
(2002)
Machine Learning
, vol.47
, Issue.2-3
, pp. 235-256
-
-
Auer, P.1
Cesa-Bianchi, N.2
Fischer, P.3
-
6
-
-
0020810556
-
The*-minimax search procedure for trees containing chance nodes
-
B.W. Ballard The*-minimax search procedure for trees containing chance nodes Artif. Intell. 21 1983 327 350
-
(1983)
Artif. Intell.
, vol.21
, pp. 327-350
-
-
Ballard, B.W.1
-
7
-
-
37249066313
-
Pattern classification in no-limit poker: A head-start evolutionary approach
-
Advances in Artificial Intelligence - 20th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2007, Proceedings
-
B. Beattie, G. Nicolai, D. Gerhard, R.J. Hilderman, Pattern classification in no-limit poker: A head-start evolutionary approach, in: Canadian Conference on AI, 2007, pp. 204-215. (Pubitemid 350269929)
-
(2007)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4509
, pp. 204-215
-
-
Beattie, B.1
Nicolai, G.2
Gerhard, D.3
Hilderman, R.J.4
-
9
-
-
84880840280
-
Approximating game-theoretic optimal strategies for full-scale poker
-
D. Billings, N. Burch, A. Davidson, R.C. Holte, J. Schaeffer, T. Schauenberg, D. Szafron, Approximating game-theoretic optimal strategies for full-scale poker, in: IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 2003, pp. 661-668.
-
(2003)
IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence
, pp. 661-668
-
-
Billings, D.1
Burch, N.2
Davidson, A.3
Holte, R.C.4
Schaeffer, J.5
Schauenberg, T.6
Szafron, D.7
-
10
-
-
0032596411
-
Using probabilistic knowledge and simulation to play poker
-
D. Billings, L.P. Castillo, J. Schaeffer, D. Szafron, Using probabilistic knowledge and simulation to play poker, in: AAAI/IAAI, 1999, pp. 697-703.
-
(1999)
AAAI/IAAI
, pp. 697-703
-
-
Billings, D.1
Castillo, L.P.2
Schaeffer, J.3
Szafron, D.4
-
11
-
-
0036149710
-
The challenge of poker
-
DOI 10.1016/S0004-3702(01)00130-8, PII S0004370201001308
-
D. Billings, A. Davidson, J. Schaeffer, and D. Szafron The challenge of poker Artif. Intell. 134 2002 201 240 (Pubitemid 34086584)
-
(2002)
Artificial Intelligence
, vol.134
, Issue.1-2
, pp. 201-240
-
-
Billings, D.1
Davidson, A.2
Schaeffer, J.3
Szafron, D.4
-
12
-
-
33745168595
-
Game-tree search with adaptation in stochastic imperfect-information games
-
DOI 10.1007/11674399-2, Computers and Games - 4th International Conference, CG 2004, Revised Papers
-
D. Billings, A. Davidson, T. Schauenberg, N. Burch, M.H. Bowling, R.C. Holte, J. Schaeffer, D. Szafron, Game-tree search with adaptation in stochastic imperfect-information games, in: Computers and Games, 4th International Conference, CG 2004, 2004, pp. 21-34. (Pubitemid 43900758)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.3846
, pp. 21-34
-
-
Billings, D.1
Davidson, A.2
Schauenberg, T.3
Burch, N.4
Bowling, M.5
Holte, R.6
Schaeffer, J.7
Szafron, D.8
-
14
-
-
0007951591
-
Using selective-sampling simulations in poker
-
D. Billings, D. Papp, L. Peña, J. Schaeffer, D. Szafron, Using selective-sampling simulations in poker, in: AAAISS-99, Proceedings of the AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, 1999.
-
(1999)
AAAISS-99, Proceedings of the AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information
-
-
Billings, D.1
-
15
-
-
0031635794
-
Opponent modeling in poker
-
D. Billings, D. Papp, J. Schaeffer, D. Szafron, Opponent modeling in poker, in: AAAI/IAAI, 1998, pp. 493-499.
-
(1998)
AAAI/IAAI
, pp. 493-499
-
-
Billings, D.1
Papp, D.2
Schaeffer, J.3
Szafron, D.4
-
16
-
-
84876767994
-
Poker as testbed for AI research
-
D. Billings, D. Papp, J. Schaeffer, D. Szafron, Poker as testbed for AI research, in: Advances in Artificial Intelligence, 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, 1998, pp. 228-238.
-
(1998)
Advances in Artificial Intelligence, 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence
, pp. 228-238
-
-
Billings, D.1
Papp, D.2
Schaeffer, J.3
Szafron, D.4
-
17
-
-
84899879099
-
A demonstration of the polaris poker system
-
Richland, SC
-
M. Bowling, N.A. Risk, N. Bard, D. Billings, N. Burch, J. Davidson, J. Hawkin, R. Holte, M. Johanson, M. Kan, B. Paradis, J. Schaeffer, D. Schnizlein, D. Szafron, K. Waugh, M. Zinkevich, A demonstration of the polaris poker system, in: AAMAS 09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2009, pp. 1391-1392.
-
(2009)
AAMAS 09: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems
, pp. 1391-1392
-
-
Bowling, M.1
Risk, N.A.2
Bard, N.3
Billings, D.4
Burch, N.5
Davidson, J.6
Hawkin, J.7
Holte, R.8
Johanson, M.9
Kan, M.10
Paradis, B.11
Schaeffer, J.12
Schnizlein, D.13
Szafron, D.14
Waugh, K.15
Zinkevich, M.16
-
21
-
-
38049037928
-
Efficient selectivity and backup operators in Monte-Carlo tree search
-
R. Coulom, Efficient selectivity and backup operators in Monte-Carlo tree search, in: Computers and Games, 5th International Conference, CG 2006, 2006, pp. 72-83.
-
(2006)
Computers and Games, 5th International Conference, CG 2006
, pp. 72-83
-
-
Coulom, R.1
-
23
-
-
0007994645
-
Improved opponent modeling in poker
-
A. Davidson, D. Billings, J. Schaeffer, D. Szafron, Improved opponent modeling in poker, in: Proceedings of the 2000 International Conference on Artificial Intelligence, 2000, pp. 1467-1473.
-
(2000)
Proceedings of the 2000 International Conference on Artificial Intelligence
, pp. 1467-1473
-
-
Davidson, A.1
Billings, D.2
Schaeffer, J.3
Szafron, D.4
-
27
-
-
24544450341
-
Machine learning in games: A survey
-
Nova Science Publishers
-
J. Fürnkranz Machine learning in games: A survey Machines That Learn to Play Games 2001 Nova Science Publishers 11 59 (Chapter 2)
-
(2001)
Machines That Learn to Play Games
, pp. 11-59
-
-
Fürnkranz, J.1
-
29
-
-
21344445698
-
General game playing: Overview of the AAAI competition
-
M.R. Genesereth, N. Love, and B. Pell General game playing: Overview of the AAAI competition AI Magazine 26 2005 62 72 (Pubitemid 40902512)
-
(2005)
AI Magazine
, vol.26
, Issue.2
, pp. 62-72
-
-
Genesereth, M.1
Love, N.2
Pell, B.3
-
30
-
-
38449110214
-
Gradient-based algorithms for finding Nash equilibria in extensive form games
-
A. Gilpin, S. Hoda, J. Peña, T. Sandholm, Gradient-based algorithms for finding Nash equilibria in extensive form games, in: Internet and Network Economics, Third International Workshop, WINE 2007, 2007, pp. 57-69.
-
(2007)
Internet and Network Economics, Third International Workshop, WINE 2007
, pp. 57-69
-
-
Gilpin, A.1
-
32
-
-
60349121820
-
Better automated abstraction techniques for imperfect information games, with application to Texas holdem poker
-
A. Gilpin, T. Sandholm, Better automated abstraction techniques for imperfect information games, with application to Texas holdem poker, in: 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007, pp. 192-200.
-
(2007)
6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007)
, pp. 192-200
-
-
Gilpin, A.1
Sandholm, T.2
-
33
-
-
35348940239
-
Lossless abstraction of imperfect information games
-
A. Gilpin, and T. Sandholm Lossless abstraction of imperfect information games J. ACM 54 2007
-
(2007)
J. ACM
, vol.54
-
-
Gilpin, A.1
Sandholm, T.2
-
34
-
-
57749102551
-
Expectation-based versus potential-aware automated abstraction in imperfect information games: An experimental comparison using poker
-
A. Gilpin, T. Sandholm, Expectation-based versus potential-aware automated abstraction in imperfect information games: An experimental comparison using poker, in: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, 2008, pp. 1454-1457.
-
(2008)
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008
, pp. 1454-1457
-
-
Gilpin, A.1
Sandholm, T.2
-
36
-
-
35348954388
-
Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker
-
AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
-
A. Gilpin, T. Sandholm, T.B. Sørensen, Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas holdem poker, in: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007, pp. 50-57. (Pubitemid 350149552)
-
(2007)
Proceedings of the National Conference on Artificial Intelligence
, vol.1
, pp. 50-57
-
-
Gilpin, A.1
Sandholm, T.2
Sorensen, T.B.3
-
37
-
-
84899954510
-
A heads-up no-limit Texas holdem poker player: Discretized betting models and automatically generated equilibrium-finding programs
-
A. Gilpin, T. Sandholm, T.B. Sørensen, A heads-up no-limit Texas holdem poker player: Discretized betting models and automatically generated equilibrium-finding programs, in: 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008, pp. 911-918.
-
(2008)
7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008)
, pp. 911-918
-
-
Gilpin, A.1
-
42
-
-
85162048790
-
Computing robust counter-strategies
-
M. Johanson, M. Zinkevich, M.H. Bowling, Computing robust counter-strategies, in: Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, 2007.
-
(2007)
Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems
-
-
Johanson, M.1
Zinkevich, M.2
Bowling, M.H.3
-
45
-
-
0016622115
-
An analysis of alpha-beta pruning
-
D.E. Knuth, and R.W. Moore An analysis of alpha-beta pruning Artif. Intell. 6 1975 293 326
-
(1975)
Artif. Intell.
, vol.6
, pp. 293-326
-
-
Knuth, D.E.1
Moore, R.W.2
-
46
-
-
33750293964
-
Bandit based Monte-Carlo planning
-
Machine Learning: ECML 2006 - 17th European Conference on Machine Learning, Proceedings
-
L. Kocsis, C. Szepesvári, Bandit based Monte-Carlo planning, in: Machine Learning: ECML 2006, 17th European Conference on Machine Learning, 2006, pp. 282-293. (Pubitemid 44618839)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4212
, pp. 282-293
-
-
Kocsis, L.1
Szepesvari, C.2
-
47
-
-
0027964134
-
Fast algorithms for finding randomized strategies in game trees
-
D. Koller, N. Megiddo, B. von Stengel, Fast algorithms for finding randomized strategies in game trees, in: Proceedings of the 26th ACM Symposium on Theory of Computing (STOC 94), 1994, pp. 750-759.
-
(1994)
Proceedings of the 26th ACM Symposium on Theory of Computing (STOC 94)
, pp. 750-759
-
-
Koller, D.1
Megiddo, N.2
Von Stengel, B.3
-
48
-
-
85168119718
-
Generating and solving imperfect information games
-
Montreal, Canada
-
D. Koller, A. Pfeffer, Generating and solving imperfect information games, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), Montreal, Canada, 1995, pp. 1185-1192.
-
(1995)
Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI)
, pp. 1185-1192
-
-
Koller, D.1
Pfeffer, A.2
-
49
-
-
0003602869
-
-
Morgan Kaufmann Publishers San Mateo, CA
-
J. Kolodner Case-Based Reasoning 1993 Morgan Kaufmann Publishers San Mateo, CA
-
(1993)
Case-Based Reasoning
-
-
Kolodner, J.1
-
50
-
-
0007953503
-
Bayesian poker
-
K.B. Korb, A.E. Nicholson, N. Jitnah, Bayesian poker, in: UAI 99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, 1999, pp. 343-350.
-
(1999)
UAI 99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence
, pp. 343-350
-
-
Korb, K.B.1
Nicholson, A.E.2
Jitnah, N.3
-
52
-
-
79953227801
-
Monte Carlo sampling for regret minimization in extensive games
-
M. Lanctot, K. Waugh, M. Zinkevich, M. Bowling, Monte Carlo sampling for regret minimization in extensive games, in: Advances in Neural Information Processing Systems 22 (NIPS), 2009, pp. 1078-1086.
-
(2009)
Advances in Neural Information Processing Systems 22 (NIPS)
, pp. 1078-1086
-
-
Lanctot, M.1
Waugh, K.2
Zinkevich, M.3
Bowling, M.4
-
55
-
-
84868297032
-
Adaptive play in Texas holdem poker
-
R. Maîtrepierre, J. Mary, R. Munos, Adaptive play in Texas holdem poker, in: ECAI 2008 - 18th European Conference on, Artificial Intelligence, 2008, pp. 458-462.
-
(2008)
ECAI 2008 - 18th European Conference On, Artificial Intelligence
, pp. 458-462
-
-
Maîtrepierre, R.1
-
60
-
-
33144470576
-
Excessive gap technique in nonsmooth convex minimization
-
DOI 10.1137/S1052623403422285
-
Y. Nesterov Excessive gap technique in nonsmooth convex minimization SIAM J. Optim. 16 2005 235 249 (Pubitemid 43268550)
-
(2006)
SIAM Journal on Optimization
, vol.16
, Issue.1
, pp. 235-249
-
-
Nesterov, Yu.1
-
61
-
-
79953230590
-
Using bayesian decision networks to play Texas holdem poker
-
Faculty of Information Technology, Monash University
-
A.E. Nicholson, K.B. Korb, D. Boulton, Using bayesian decision networks to play Texas holdem poker, Technical Report, Faculty of Information Technology, Monash University, 2006.
-
(2006)
Technical Report
-
-
Nicholson, A.E.1
Korb, K.B.2
Boulton, D.3
-
62
-
-
71549152823
-
No-limit Texas holdem poker agents created with evolutionary neural networks
-
G. Nicolai, R. Hilderman, No-limit Texas holdem poker agents created with evolutionary neural networks, in: CIG-2009, IEEE Symposium on Computational Intelligence and Games, 2009, pp. 125-131.
-
(2009)
CIG-2009, IEEE Symposium on Computational Intelligence and Games
, pp. 125-131
-
-
Nicolai, G.1
Hilderman, R.2
-
64
-
-
2542575116
-
Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selection
-
Morgan Kaufmann
-
J. Noble, and R.A. Watson Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selection Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001 2001 Morgan Kaufmann 493 500
-
(2001)
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001
, pp. 493-500
-
-
Noble, J.1
Watson, R.A.2
-
69
-
-
62349130798
-
Evolving Nash-optimal poker strategies using evolutionary computation
-
H. Quek, C. Woo, K.C. Tan, and A. Tay Evolving Nash-optimal poker strategies using evolutionary computation Frontiers Comput. Sci. China 3 2009 73 91
-
(2009)
Frontiers Comput. Sci. China
, vol.3
, pp. 73-91
-
-
Quek, H.1
Woo, C.2
Tan, K.C.3
Tay, A.4
-
75
-
-
37349072470
-
Investigating the effectiveness of applying case-based reasoning to the game of Texas Hold'em
-
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2007
-
J. Rubin, I. Watson, Investigating the effectiveness of applying case-based reasoning to the game of Texas holdem, in: Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007, pp. 417-422. (Pubitemid 350295305)
-
(2007)
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2007
, pp. 417-422
-
-
Rubin, J.1
Watson, I.2
-
76
-
-
77954987132
-
A memory-based approach to two-player Texas holdem
-
J. Rubin, I. Watson, A memory-based approach to two-player Texas holdem, in: AI 2009: Advances in Artificial Intelligence, 22nd Australasian Joint Conference, 2009, pp. 465-474.
-
(2009)
AI 2009: Advances in Artificial Intelligence, 22nd Australasian Joint Conference
, pp. 465-474
-
-
Rubin, J.1
Watson, I.2
-
77
-
-
77954967196
-
Similarity-based retrieval and solution re-use policies in the game of Texas holdem
-
Springer-Verlag
-
J. Rubin, and I. Watson Similarity-based retrieval and solution re-use policies in the game of Texas holdem Case-Based Reasoning. Research and Development, 18th International Conference on Case-Based Reasoning Lecture Notes in Computer Science vol. 6176 2010 Springer-Verlag 465 479
-
(2010)
Lecture Notes in Computer Science
, vol.6176
, pp. 465-479
-
-
Rubin, J.1
Watson, I.2
-
80
-
-
0000302898
-
The games computers (and people) play
-
J. Schaeffer The games computers (and people) play Adv. Comput. 52 2000 190 268
-
(2000)
Adv. Comput.
, vol.52
, pp. 190-268
-
-
Schaeffer, J.1
-
81
-
-
0035441917
-
A gamut of games
-
J. Schaeffer A gamut of games AI Magazine 22 2001 29 46 (Pubitemid 32935356)
-
(2001)
AI Magazine
, vol.22
, Issue.3
, pp. 29-46
-
-
Schaeffer, J.1
-
83
-
-
78751687085
-
Probabilistic state translation in extensive games with large action sets
-
D. Schnizlein, M.H. Bowling, D. Szafron, Probabilistic state translation in extensive games with large action sets, in: IJCAI 2009, Proceedings of the 21st International Joint Conference on, Artificial Intelligence, 2009, pp. 278-284.
-
(2009)
IJCAI 2009, Proceedings of the 21st International Joint Conference On, Artificial Intelligence
, pp. 278-284
-
-
Schnizlein, D.1
Bowling, M.H.2
Szafron, D.3
-
85
-
-
76649083426
-
An exploitative Monte-Carlo poker agent
-
Technische Universität Darmstadt
-
I. Schweizer, K. Panitzek, S.H. Park, J. Fürnkranz, An exploitative Monte-Carlo poker agent, Technical Report, Technische Universität Darmstadt, 2009.
-
(2009)
Technical Report
-
-
Schweizer, I.1
-
87
-
-
0036146034
-
World-championship-caliber Scrabble
-
DOI 10.1016/S0004-3702(01)00166-7, PII S0004370201001667
-
B. Sheppard World-championship-caliber scrabble Artif. Intell. 134 2002 241 275 (Pubitemid 34086585)
-
(2002)
Artificial Intelligence
, vol.134
, Issue.1-2
, pp. 241-275
-
-
Sheppard, B.1
-
88
-
-
0007901028
-
Abstraction methods for game theoretic poker
-
J. Shi, M.L. Littman, Abstraction methods for game theoretic poker, in: Computers and Games, Second International Conference, CG, 2000, pp. 333-345.
-
(2000)
Computers and Games, Second International Conference, CG
, pp. 333-345
-
-
Shi, J.1
Littman, M.L.2
-
89
-
-
0007899044
-
-
Two Plus Two Publishing Las Vegas, Nevada
-
D. Sklansky The Theory of Poker 2005 Two Plus Two Publishing Las Vegas, Nevada
-
(2005)
The Theory of Poker
-
-
Sklansky, D.1
-
91
-
-
0029276036
-
Temporal difference learning and td-gammon
-
G. Tesauro Temporal difference learning and td-gammon Commun. ACM 38 1995 58 68
-
(1995)
Commun. ACM
, vol.38
, pp. 58-68
-
-
Tesauro, G.1
-
92
-
-
70549113669
-
Monte-Carlo tree search in poker using expected reward distributions
-
G. Van den Broeck, K. Driessens, J. Ramon, Monte-Carlo tree search in poker using expected reward distributions, in: Advances in Machine Learning, First Asian Conference on Machine Learning, ACML 2009, 2009, pp. 367-381.
-
(2009)
Advances in Machine Learning, First Asian Conference on Machine Learning, ACML 2009
, pp. 367-381
-
-
Broeck Den G.Van1
Driessens, K.2
Ramon, J.3
-
94
-
-
58349099701
-
Casper: A case-based poker-bot
-
I. Watson, J. Rubin, Casper: A case-based poker-bot, in: AI 2008: Advances in Artificial Intelligence, 21st Australasian Joint Conference on Artificial Intelligence, 2008, pp. 594-600.
-
(2008)
AI 2008: Advances in Artificial Intelligence, 21st Australasian Joint Conference on Artificial Intelligence
, pp. 594-600
-
-
Watson, I.1
Rubin, J.2
-
95
-
-
79953214671
-
Strategy grafting in extensive games
-
K. Waugh, N. Bard, M. Bowling, Strategy grafting in extensive games, in: Advances in Neural Information Processing Systems 22 (NIPS), 2009, pp. 2026-2034.
-
(2009)
Advances in Neural Information Processing Systems 22 (NIPS)
, pp. 2026-2034
-
-
Waugh, K.1
Bard, N.2
Bowling, M.3
-
96
-
-
84899862546
-
Abstraction pathologies in extensive games
-
K. Waugh, D. Schnizlein, M.H. Bowling, D. Szafron, Abstraction pathologies in extensive games, in: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009, pp. 781-788.
-
(2009)
8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009)
, pp. 781-788
-
-
Waugh, K.1
Schnizlein, D.2
Bowling, M.H.3
Szafron, D.4
-
97
-
-
84890303245
-
A practical use of imperfect recall
-
K. Waugh, M. Zinkevich, M. Johanson, M. Kan, D. Schnizlein, M.H. Bowling, A practical use of imperfect recall, in: Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009, 2009.
-
(2009)
Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009
-
-
Waugh, K.1
Zinkevich, M.2
Johanson, M.3
Kan, M.4
Schnizlein, D.5
Bowling, M.H.6
-
99
-
-
36348936128
-
A new algorithm for generating equilibria in massive zero-sum games
-
AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
-
M. Zinkevich, M.H. Bowling, N. Burch, A new algorithm for generating equilibria in massive zero-sum games, in: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007, pp. 788-793. (Pubitemid 350149666)
-
(2007)
Proceedings of the National Conference on Artificial Intelligence
, vol.1
, pp. 788-793
-
-
Zinkevich, M.1
Bowling, M.2
Burch, N.3
-
100
-
-
85162042235
-
Regret minimization in games with incomplete information
-
M. Zinkevich, M. Johanson, M.H. Bowling, C. Piccione, Regret minimization in games with incomplete information, in: Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, 2007.
-
(2007)
Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems
-
-
Zinkevich, M.1
Johanson, M.2
Bowling, M.H.3
Piccione, C.4
|