1599 search results - page 62 / 320 » Algorithms for Parity Games |
CIMCA
2008
IEEE
15 years 5 months ago
2008
IEEE
We introduce a language for the representation of a subset of strategic interactions. The representation is based on petri nets. Representable games are restricted to have a fini...
FSTTCS
2008
Springer
15 years 14 days ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...