Sciweavers

205 search results - page 11 / 41
» One-Counter Stochastic Games
Sort
View
NIPS
2007
13 years 9 months ago
Competition Adds Complexity
It is known that determinining whether a DEC-POMDP, namely, a cooperative partially observable stochastic game (POSG), has a cooperative strategy with positive expected reward is ...
Judy Goldsmith, Martin Mundhenk
SIAMCO
2010
105views more  SIAMCO 2010»
13 years 6 months ago
The Continuous Time Nonzero-Sum Dynkin Game Problem and Application in Game Options
In this paper we study the nonzero-sum Dynkin game in continuous time, which is a two-player noncooperative game on stopping times. We show that it has a Nash equilibrium point for...
Said Hamadène, Jianfeng Zhang
AMC
2008
86views more  AMC 2008»
13 years 7 months ago
Numerical solution of stochastic Nash games with state-dependent noise for weakly coupled large-scale systems
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
Muneomi Sagara, Hiroaki Mukaidani, Toru Yamamoto
CG
2006
Springer
13 years 9 months ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White
CIG
2005
IEEE
13 years 9 months ago
Monte Carlo Planning in RTS Games
Abstract- Monte Carlo simulations have been successfully used in classic turn–based games such as backgammon, bridge, poker, and Scrabble. In this paper, we apply the ideas to th...
Michael Chung, Michael Buro, Jonathan Schaeffer