Learning algorithms for repeated bimatrix Nash games with incomplete information

DOI10.1007/BF00939817zbMath0654.90107MaRDI QIDQ1108947

George P. Papavassilopoulos

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

learning algorithmsgames with incomplete informationbimatrix gamesNash gamerecursive scheme for updating

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Related Items (2)

An Adaptive Learning Game Model for Interacting Electric Power Markets ⋮ ASPIRATION-BASED REINFORCEMENT LEARNING IN REPEATED INTERACTION GAMES: AN OVERVIEW

Cites Work

• Unnamed Item
• Unnamed Item
• The use of learning algorithms in telephone traffic routing - a methodology
• Dynamic noncooperative game theory
• Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters

This page was built for publication: Learning algorithms for repeated bimatrix Nash games with incomplete information