128 search results - page 1 / 26 » Computing optimal strategies to commit to in extensive-form ... |
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
AAAI
2012
11 years 7 months ago
2012
WINE
2007
Springer
13 years 11 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
AAAI
2012
11 years 7 months ago
2012
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...