Learning algorithms for repeated bimatrix Nash games with incomplete information
From MaRDI portal
(Redirected from Publication:1108947)
Recommendations
Cites work
- Dynamic noncooperative game theory
- scientific article; zbMATH DE number 3131266 (Why is no real title available?)
- scientific article; zbMATH DE number 3738921 (Why is no real title available?)
- 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
(8)- Absolutely expedient algorithms for learning Nash equilibria
- Aspiration-based reinforcement learning in repeated interaction games: An overview
- On learning algorithms for Nash equilibria
- Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information
- A note on bimatrix games with an unknown payoff matrix
- Learning in network contexts: experimental results from simulations
- An Adaptive Learning Game Model for Interacting Electric Power Markets
- An interconnection game between mobile network operators: hidden information forecasting using expert advice fusion
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)