5995 search results - page 28 / 1199 » Algorithmic Game Theory |
83
Voted
CORR
2010
Springer
14 years 10 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...
108
click to vote
IE
2007
15 years 1 months ago
2007
By blurring the boundary between game fiction and reality, Pervasive Games impact the shared space of the city areas that they use as gaming platform. Drawing on notions of spatia...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
ICAISC
2004
Springer
15 years 4 months ago
2004
Springer
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...
113
Voted
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...