533 search results - page 19 / 107 » Playing games with approximation algorithms |
IJCAI
2003
15 years 3 months ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
143
Voted
BIBE
2008
IEEE
15 years 8 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
117
Voted
FOCS
2010
IEEE
14 years 12 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
112
click to vote
FORMATS
2006
Springer
15 years 5 months ago
2006
Springer
We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL b...
119
Voted
GD
2003
Springer
15 years 7 months ago
2003
Springer
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...