4435 search results - page 85 / 887 » Algorithms, games, and the internet |
115
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
84
Voted
ATAL
2008
Springer
15 years 8 days ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
87
Voted
AAAI
2004
14 years 11 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
101
Voted
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...