1410 search results - page 112 / 282 » The Algorithmics of Solitaire-Like Games |
FORMATS
2008
Springer
15 years 28 days ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
UAI
2001
15 years 22 days ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
SIAMCOMP
2008
14 years 11 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
CAV
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
105
click to vote
ML
2007
ACM
14 years 11 months ago
2007
ACM
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...