Sciweavers

350 search results - page 8 / 70
» On Strategy Improvement Algorithms for Simple Stochastic Gam...
Sort
View
NIPS
2007
14 years 11 months ago
Computing Robust Counter-Strategies
Adaptation to other initially unknown agents often requires computing an effective counter-strategy. In the Bayesian paradigm, one must find a good counterstrategy to the inferre...
Michael Johanson, Martin Zinkevich, Michael H. Bow...
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
83
Voted
FLAIRS
2011
14 years 27 days ago
Learning Opponent Strategies through First Order Induction
In a competitive game it is important to identify the opponent’s strategy as quickly and accurately as possible so that an effective response can be staged. In this vain, this p...
Katie Long Genter, Santiago Ontañón,...
ATAL
2008
Springer
14 years 11 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman
IJCAI
2001
14 years 10 months ago
Rational and Convergent Learning in Stochastic Games
This paper investigates the problem of policy learning in multiagent environments using the stochastic game framework, which we briefly overview. We introduce two properties as de...
Michael H. Bowling, Manuela M. Veloso