Dynamics of Boltzmann Q-Learning in Two-Player Two-Action Games

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 12 figures. Version 2: added more extensive discussion of asymmetric equilibria; clarified conditions for continuous

Scientific paper

We consider the dynamics of Q-learning in two-player two-action games with a Boltzmann exploration mechanism. For any non-zero exploration rate the dynamics is dissipative, which guarantees that agent strategies converge to rest points that are generally different from the game's Nash Equlibria (NE). We provide a comprehensive characterization of the rest point structure for different games, and examine the sensitivity of this structure with respect to the noise due to exploration. Our results indicate that for a class of games with multiple NE the asymptotic behavior of learning dynamics can undergo drastic changes at critical exploration rates. Furthermore, we demonstrate that for certain games with a single NE, it is possible to have additional rest points (not corresponding to any NE) that persist for a finite range of the exploration rates and disappear when the exploration rates of both players tend to zero.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dynamics of Boltzmann Q-Learning in Two-Player Two-Action Games 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 Dynamics of Boltzmann Q-Learning in Two-Player Two-Action Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamics of Boltzmann Q-Learning in Two-Player Two-Action Games will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-306732

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.