Sciweavers

533 search results - page 18 / 107
» Playing games with approximation algorithms
Sort
View
WINE
2007
Springer
161views Economy» more  WINE 2007»
14 years 3 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
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 ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 7 months ago
Approximation Algorithms for Domination Search
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...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ATAL
2008
Springer
13 years 11 months ago
Approximating power indices
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...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 9 months ago
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Prahladh Harsha, Moses Charikar, Matthew Andrews, ...