Sciweavers

3780 search results - page 9 / 756
» Algorithms for Game Metrics
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
ENTCS
2008
123views more  ENTCS 2008»
13 years 7 months ago
A Multi-Core Solver for Parity Games
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
Jaco van de Pol, Michael Weber 0002
JACM
2007
160views more  JACM 2007»
13 years 7 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
13 years 11 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla