19 search results - page 1 / 4 » Winning Fast in Sparse Graph Construction Games |
CPC
2008
13 years 4 months ago
2008
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
FSTTCS
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
JCT
2007
13 years 4 months ago
2007
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...