1599 search results - page 61 / 320 » Algorithms for Parity Games |
105
click to vote
CG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
LICS
2000
IEEE
15 years 3 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
ESA
2005
Springer
15 years 4 months ago
2005
Springer
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
UAI
2001
15 years 23 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...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Can a good learner compensate for a poor learner when paired in a coordination game? Previous work has given an example where a special learning algorithm (FMQ) is capable of doin...