1599 search results - page 44 / 320 » Algorithms for Parity Games |
107
click to vote
AAAI
2012
13 years 1 months ago
2012
The multiagent systems community has adopted game theory as a framework for the design of systems of multiple self-interested agents. For this to be effective, efficient algorith...
STOC
1997
ACM
15 years 3 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
CG
2008
Springer
15 years 1 months ago
2008
Springer
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an ...
101
click to vote
ERSHOV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
CIE
2008
Springer
15 years 1 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...