Learning to Cooperate via Policy Search

Details Learning to Cooperate via Policy Search Learning to Cooperate via Policy Search

2001-05-25

arxiv.org/abs/cs/0105032v1

Sixteenth Conference on Uncertainty in Artificial Intelligence, 2000

Computer Science

Learning

8 pages, 5 figures

Scientific paper

Cooperative games are those in which both agents share the same payoff structure. Value-based reinforcement-learning algorithms, such as variants of Q-learning, have been applied to learning cooperative games, but they only apply when the game state is completely observable to both agents. Policy search methods are a reasonable alternative to value-based methods for partially observable environments. In this paper, we provide a gradient-based distributed policy-search method for cooperative games and compare the notion of local optimum to that of Nash equilibrium. We demonstrate the effectiveness of this method experimentally in a small, partially observable simulated soccer domain.

Affiliated with

Also associated with

No associations

Rating

Learning to Cooperate via Policy Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning to Cooperate via Policy Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning to Cooperate via Policy Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538203