Learning algorithms for repeated bimatrix Nash games with incomplete information

DOI10.1007/BF00939817zbMATH Open0654.90107MaRDI QIDQ1108947FDOQ1108947

Authors: George P. Papavassilopoulos 

Publication date: 1989

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

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

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)

Cites Work

• Dynamic noncooperative game theory
• Title not available (Why is that?)
• Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters
• Title not available (Why is that?)
• The use of learning algorithms in telephone traffic routing - a methodology

Cited In (7)

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

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)