Sciweavers

5995 search results - page 21 / 1199
» Algorithmic Game Theory
Sort
View
FSTTCS
2008
Springer
14 years 10 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
91
Voted
CG
2004
Springer
15 years 1 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
ATAL
2008
Springer
14 years 11 months ago
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding progr
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...
AAAI
2012
12 years 12 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...

Presentation
438views
16 years 8 months ago
Games with Incomplete Information
A talk on Nobel Talk by Nobel laureate John C Harsayni, in Topics in Game Theory Course, IISc, November 2008