533 search results - page 29 / 107 » Playing games with approximation algorithms |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
CG
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
IAT
2008
IEEE
13 years 7 months ago
2008
IEEE
Use of game-theoretic models to address patrolling applications has gained increasing interest in the very last years. The patrolling agent is considered playing a game against an...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
AI
2007
Springer
14 years 1 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 ...