533 search results - page 18 / 107 » Playing games with approximation algorithms |
117
Voted
WINE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
115
Voted
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
133
Voted
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
114
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
CORR
2010
Springer
15 years 1 months ago
2010
Springer