89 search results - page 3 / 18 » Admissibility in Infinite Games |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. ...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
DAM
2008
13 years 5 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. H...
LICS
1997
IEEE
13 years 9 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...