scientific article; zbMATH DE number 1931819

zbMATH Open1014.68131MaRDI QIDQ4709178FDOQ4709178

Authors: Bikramjit Banerjee, Jing Peng 

Publication date: 20 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2430/24300001.htm

Title of this publication is not available (Why is that?)

Recommendations

• Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
• On gradient-based learning in continuous games
• Multiagent learning using a variable learning rate
• AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
• Convergent learning algorithms for unknown reward games

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80)

Cited In (8)

• Gradient methods for solving Stackelberg games
• AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
• DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES
• Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
• On gradient-based learning in continuous games
• Continuous-Time Discounted Mirror Descent Dynamics in Monotone Concave Games
• The evolutionary dynamics of soft-max policy gradient in multi-agent settings
• Policy invariance under reward transformations for general-sum stochastic games

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709178)