Rules for computing resistance of transitions of learning algorithms in games

DOI10.1007/978-3-319-67540-4_9MaRDI QIDQ4588262zbMATH OpenOpenAlexFDO

Authors Mohammed Ali, Pierre Coucheney, Marceau Coupechoux

Publication date 1 November 2017

Published in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-67540-4_9

zbMATH Keywords

learning algorithmslog-linear learningperturbed Markov chainspotential gamesresistance of transitions

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Noncooperative games (91A10) Rationality and learning in game theory (91A26)

Recommendations

• A numerical analysis of the evolutionary stability of learning rules
• The logit-response dynamics
• A strategic learning algorithm for state-based games
• scientific article; zbMATH DE number 549853
• A behavioral learning process in games

This page was built for publication: Rules for computing resistance of transitions of learning algorithms in games

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