1599 search results - page 111 / 320 » Algorithms for Parity Games |
173
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
While there is a broad theoretic foundation for creating computational players for two-player games, such as Chess, the multi-player domain is not as well explored. We make an att...
221
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
141
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We consider a version of the game "Twenty Questions" played on the set {0,
171
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
180
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....