344 search results - page 30 / 69 » Banach-Mazur Games on Graphs |
ICASSP
2011
IEEE
13 years 11 days ago
2011
IEEE
Correlated equilibria are a generalization of Nash equilibria that permit agents to act in a correlated manner and can therefore, model learning in games. In this paper we define...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
EMMCVPR
2001
Springer
14 years 1 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
FOSSACS
2012
Springer
12 years 4 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...