5995 search results - page 136 / 1199 » Algorithmic Game Theory |
126
Voted
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
133
Voted
LICS
2000
IEEE
15 years 8 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 ...
135
Voted
FORMATS
2008
Springer
15 years 5 months 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...
123
Voted
ESA
2005
Springer
15 years 9 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 ...
149
Voted
ENTCS
2002
15 years 3 months ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...