1653 search results - page 116 / 331 » Computer science and game theory |
CORR
2010
Springer
14 years 8 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...
ACMACE
2007
ACM
14 years 11 months ago
2007
ACM
As virtual worlds and games grow in both personal and cultural importance, present limitations in access to them is increasingly limiting their ability to achieve their potential....
120
click to vote
SIGCSE
2009
ACM
15 years 10 months ago
2009
ACM
Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets ...
106
click to vote
CADE
1992
Springer
15 years 2 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
CIG
2006
IEEE
15 years 4 months ago
2006
IEEE
— People play games for fun. Yet we are lacking a fundamental understanding of what fun is and how fun works in games and other media. For example, why do thousands of people spe...