344 search results - page 57 / 69 » Banach-Mazur Games on Graphs |
AAAI
2010
13 years 10 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
IJIT
2004
13 years 10 months ago
2004
Both software applications and their development environment are becoming more and more distributed. This trend impacts not only the way software computes, but also how it looks. T...
IANDC
2006
13 years 8 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
APAL
2008
13 years 8 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
JCT
2007
13 years 8 months ago
2007
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...