3455 search results - page 100 / 691 » Generalized Game Trees |
135
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
126
click to vote
MLQ
2008
15 years 4 months ago
2008
We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on 2. The main purpose of this paper is ...
153
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
110
click to vote
SASO
2009
IEEE
15 years 11 months ago
2009
IEEE
—We examine the use of teleological metareasoning for self-adaptation in game-playing software agents. The goal of our work is to develop an interactive environment in which the ...
138
click to vote
SAGT
2009
Springer
15 years 11 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...