533 search results - page 17 / 107 » Playing games with approximation algorithms |
ECCC
2006
13 years 7 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbi...
SIGECOM
2004
ACM
14 years 29 days ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...