5995 search results - page 114 / 1199 » Algorithmic Game Theory |
160
Voted
COCO
2010
Springer
15 years 7 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
127
Voted
CORR
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
170
Voted
ROBOCUP
2004
Springer
15 years 9 months ago
2004
Springer
The paper discusses a top-down approach to model soccer knowledge, as it can be found in soccer theory books. The goal is to model soccer strategies and tactics in a way that they ...
126
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
129
Voted
AAAI
2006
15 years 5 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...