Sciweavers

344 search results - page 1 / 69
» Banach-Mazur Games on Graphs
Sort
View
FSTTCS
2008
Springer
15 years 1 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
JSYML
2007
70views more  JSYML 2007»
15 years 9 days ago
Winning the pressing down game but not Banach-Mazur
Jakob Kellner, Matti Pauna, Saharon Shelah
79
Voted
IANDC
2008
74views more  IANDC 2008»
15 years 14 days ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
99
Voted
CIG
2006
IEEE
15 years 6 months ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
116
Voted
AAAI
2012
13 years 2 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang