Learning algorithms for repeated bimatrix Nash games with incomplete information

DOI10.1007/BF00939817MaRDI QIDQ1108947zbMATH OpenFDO

Authors George P. Papavassilopoulos

Publication date 1989

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

zbMATH Keywords

bimatrix gameslearning algorithmsgames with incomplete informationNash gamerecursive scheme for updating

Mathematics Subject Classification ID

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

Recommendations

• Absolutely expedient algorithms for learning Nash equilibria
• Fictitious play with incomplete learning
• A note on bimatrix games with an unknown payoff matrix
• Averaged predictions and the learning of equilibrium play
• On learning algorithms for Nash equilibria

Cites work

• scientific article; zbMATH DE number 3131266 (Why is no real title available?)
• scientific article; zbMATH DE number 3738921 (Why is no real title available?)
• Dynamic noncooperative game theory
• Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters
• The use of learning algorithms in telephone traffic routing - a methodology

Cited in

(7)

• Learning in network contexts: experimental results from simulations
• Aspiration-based reinforcement learning in repeated interaction games: An overview
• An interconnection game between mobile network operators: hidden information forecasting using expert advice fusion
• Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information
• A note on bimatrix games with an unknown payoff matrix
• On learning algorithms for Nash equilibria
• An Adaptive Learning Game Model for Interacting Electric Power Markets

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

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