Why do they always win?

DOI10.14794/ICAI.9.2014.2.231MaRDI QIDQ5369829zbMATH OpenFDO

Authors Tamás László Balogh, János Kormos

Publication date 19 October 2017

Published in Proceedings of the 9th International Conference on Applied Informatics, Volume 2 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14794/ICAI.9.2014.2.231

zbMATH Keywords

communication networkscomputational game theoryMarkov chainsnoncooperative gamesoutguessingreasoning

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic models, generic numerical methods in probability and statistics (65C20) Communication networks in operations research (90B18) Noncooperative games (91A10) Other game-theoretic models (91A40)

Recommendations

• scientific article; zbMATH DE number 3915324
• Why Did They Do That?

Cited in

(3)

• Does seeing more deeply into a game increase one's chances of winning?
• Reaching win-win state of mind in games, formulation and solution
• A computational model of outguessing in two-player non-cooperative games

This page was built for publication: Why do they always win?

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