Sciweavers

1599 search results - page 44 / 320
» Algorithms for Parity Games
Sort
View
AAAI
2012
13 years 8 months ago
Computing Game-Theoretic Solutions and Applications to Security
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...
Vincent Conitzer
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
15 years 10 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
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:
Itzhak Parnafes, Ran Raz, Avi Wigderson
CG
2008
Springer
15 years 8 months ago
An Analysis of UCT in Multi-player Games
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 ...
Nathan R. Sturtevant
ERSHOV
2006
Springer
15 years 9 months ago
Linear Complementarity and P-Matrices for Stochastic Games
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
Ola Svensson, Sergei G. Vorobyov
CIE
2008
Springer
15 years 8 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
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...
Marcin Jurdzinski, Rahul Savani