We propose an algorithm for computing approximate Nash equilibria of partially observable games using Monte-Carlo tree search based on recent bandit methods. We obtain experimental results for theâ€¦ (More)

Upper Confidence Trees (UCT) are now a well known algorithm for sequential decision making; it is a provably consistent variant of Monte-Carlo Tree Search. However, the consistency is only proved inâ€¦ (More)

Let G be a simple, undirected, connected graph with vertex set V (G) and C âŠ† V (G) be a set of vertices whose elements are called codewords. For v âˆˆ V (G) and r â‰¥ 1, let us denote by I r (v) the setâ€¦ (More)

Let G = (V,E) be a simple, undirected graph. Given an integer r â‰¥ 1, we say that G is r-twin-free (or r-identifiable) if the balls B(v, r) for v âˆˆ V are all different, where B(v, r) denotes the setâ€¦ (More)

Let G = (V (G), E(G)) be an undirected graph. A watcher w of G is a couple w = (`(w), A(w)), where `(w) belongs to V (G) and A(w) is a set of vertices of G at distance 0 or 1 from `(w). If a vertex vâ€¦ (More)