800 search results - page 78 / 160 » On the Complexity of Parity Games |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
AGENTS
2001
Springer
14 years 1 months ago
2001
Springer
The complexity of AI characters in computer games is continually improving; however they still fall short of human players. In this paper we describe an AI bot for the game Quake ...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— Consider the situation in which a decision maker (Actor) has to decide which of several available resources to use in the presence of an adversary (called Controller) that can ...
AAAI
2007
13 years 11 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...