Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game

MaRDI QIDQ1650409zbMATH OpenFDO

Authors Boris Hâncu, Anatolie Gladei

Publication date 3 July 2018

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL http://www.math.md/publications/csjm/issues/v26-n1/12567/

zbMATH Keywords

parallel algorithmNash equilibriumcommunication complexitystrategytime complexitybimatrix gameBayes-Nash solution

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 2-person games (91A05) Parallel algorithms in computer science (68W10)

Recommendations

• On an algorithm for Nash equilibria determination in the informational extended bimatrix games
• An algorithm for determination of Nash equilibria in the informational extended two-matrix games
• Un nuevo algoritmo para la resolucion de juegos bimatriciales
• Efficient decomposition of bimatrix games (extended abstract)
• A procedure for finding Nash equilibria in bi-matrix games

Cited in

(1)

• On an algorithm for Nash equilibria determination in the informational extended bimatrix games

This page was built for publication: Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game

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