44 search results - page 3 / 9 » The Complexity of Winning Strategies in Infinite Games |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
ACL
2011
12 years 11 months ago
2011
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
MFCS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...