148 search results - page 2 / 30 » Security Games with Incomplete Information |
NIPS
2007
13 years 6 months ago
2007
Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has re...
SIGECOM
2004
ACM
13 years 10 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...
TARK
2007
Springer
13 years 11 months ago
2007
Springer
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...