344 search results - page 32 / 69 » Banach-Mazur Games on Graphs |
AGTIVE
2007
Springer
14 years 2 months ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
CVPR
2003
IEEE
14 years 1 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
ECCC
2010
13 years 8 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
KI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...