533 search results - page 5 / 107 » Playing games with approximation algorithms |
122
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
127
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...
122
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
A new problem of retrieving social games from unstructured videos is proposed. Social games are characterized by repetitions (with variations) of alternating turns between two pla...
101
Voted
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
150
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...