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...
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...
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...
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...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
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...