1599 search results - page 81 / 320 » Algorithms for Parity Games |
AI
2007
Springer
15 years 5 months ago
2007
Springer
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
104
click to vote
DAC
2006
ACM
16 years 19 days ago
2006
ACM
Graphics-intensive computer games are no longer restricted to highperformance desktops, but are also available on a variety of portable devices ranging from notebooks to PDAs and ...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can co...
106
click to vote
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...