1599 search results - page 35 / 320 » Algorithms for Parity Games |
ICML
1998
IEEE
16 years 3 days ago
1998
IEEE
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
STOC
2006
ACM
15 years 11 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
ISPDC
2008
IEEE
15 years 5 months ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
SAGT
2010
Springer
14 years 9 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
ICML
2004
IEEE
16 years 3 days ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...