107 search results - page 8 / 22 » Near-optimal algorithms for unique games |
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
ASPDAC
2004
ACM
15 years 5 months ago
2004
ACM
—The routing environment for the new emerging mixed-signal System-on-Package (SOP) technology is more advanced than that of the conventional PCB or MCM technology – pins are lo...
100
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
CG
2006
Springer
15 years 3 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...
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...