Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Michael Johanson"'
Autor:
Angeliki Lazaridou, Yoram Bachrach, Richard Everett, Wojciech Marian Czarnecki, Thore Graepel, Edward Hughes, Joel Z. Leibo, Michael Johanson, Marc Lanctot
When autonomous agents interact in the same environment, they must often cooperate to achieve their goals. One way for agents to cooperate effectively is to form a team, make a binding agreement on a joint plan, and execute it. However, when agents a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93f032e9e0b8d74f8191b01acc3787b1
Publikováno v:
Communications of the ACM. 60:81-88
Poker is a family of games that exhibit imperfect information, where players do not have full knowledge of past events. While many perfect information games have been solved (e.g., Connect-Four and checkers), no nontrivial imperfect information game
Publikováno v:
Science. 347:145-149
I'll see your program and raise you mine One of the fundamental differences between playing chess and two-handed poker is that the chessboard and the pieces on it are visible throughout the entire game, but an opponent's cards in poker are private. T
Autor:
Neil Burch, Viliam Lisý, Michael Johanson, Matej Moravcik, Martin Schmid, Trevor Davis, Dustin Morrill, Kevin Waugh, Michael Bowling, Nolan Bard
Publikováno v:
Science (New York, N.Y.). 356(6337)
Artificial intelligence has seen several breakthroughs in recent years, with games often serving as milestones. A common feature of these games is that players have perfect information. Poker, the quintessential game of imperfect information, is a lo
Autor:
Jack van Rijswijck, Morgan Kan, Ryan B. Hayward, Yngvi Björnsson, Nathan Po, Michael Johanson
Publikováno v:
Theoretical Computer Science. 349:123-139
We present an algorithm that determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm recursively searches the game-tree, combining fixed and dynamic game-state virtual connec
Publikováno v:
ICML
Typically agent evaluation is done through Monte Carlo estimation. However, stochastic agent decisions and stochastic outcomes can make this approach inefficient, requiring many samples for an accurate estimate. We present a new technique that can be
Publikováno v:
Graph Theory in Paris ISBN: 9783764372286
In 1981 Claude Berge asked about combinatorial properties that might be used to solve Hex puzzles. In response, we establish properties of dead, or negligible, cells in Hex and the Shannon game.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6445bbe3ad5557d769d74eab2009aeb1
https://doi.org/10.1007/978-3-7643-7400-6_5
https://doi.org/10.1007/978-3-7643-7400-6_5
Publikováno v:
Advances in Computer Games ISBN: 9781475744248
ACG
ACG
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::799e91e49431ef5098449254f293506d
https://doi.org/10.1007/978-0-387-35706-5_17
https://doi.org/10.1007/978-0-387-35706-5_17
Autor:
George Konidaris, Hung Hai Bui, Amarda Shehu, David Poole, Kristian Kersting, Mehul Bhatt, Christopher W. Geib, Juan Cortés, Vibhav Gogate, Christopher Archibald, Diane J. Cook, Vikas Agrawal, Hans W. Guesgen, Marc Pickett, Dietmar Jannach, Michael Johanson, Lokendra Shastri, Vedran Podobnik, Lars Kotthoff, Gita Sukthankar, Sriraam Natarajan, Barry O'Sullivan, Martin Michalowski
Publikováno v:
Scopus-Elsevier
AI Magazine; Vol 34, No 4: Winter 2013; 108-115
AI Magazine; Vol 34, No 4: Winter 2013; 108-115
The AAAI-13 Workshop Program, a part of the 27th AAAI Conference on Artificial Intelligence, was held Sunday and Monday, July 14–15, 2013 at the Hyatt Regency Bellevue Hotel in Bellevue, Washington, USA. The program included 12 workshops coveri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a00183b85a75fcbfe84b667c6da3e2f1
http://www.scopus.com/inward/record.url?eid=2-s2.0-84896356165&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84896356165&partnerID=MN8TOARS