1599 search results - page 86 / 320 » Algorithms for Parity Games |
101
click to vote
STOC
2005
ACM
16 years 4 hour ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Most work in game theory is conducted under the assumption that the players are expected utility maximizers. Expected utility is a very tractable decision model, but is prone to w...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
109
click to vote
ACMACE
2005
ACM
15 years 5 months ago
2005
ACM
This paper presents a hybrid geometrical-physical, plastic deformation technique applicable for solids, in the context of a car simulation game. This technique doesn’t aim to be...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...