A computational model of outguessing in two-player non-cooperative games

DOI10.2478/ausi-2014-0019zbMath1367.91009OpenAlexW1997840310MaRDI QIDQ399507

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

Publication date: 19 August 2014

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2014-0019

zbMATH Keywords

Markov chainscommunication networksreasoningnoncooperative gamescomputational game theoryoutguessing

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Non-cooperative games
• The Doctrine of Chances
• Markov Chains and Stochastic Stability
• Markov Chains
• Do People Rely on the Self-Interested Maximization of Others? An Experimental Test
• Stochastic game theory: For playing games, not just for doing theory
• Control Techniques for Complex Networks

This page was built for publication: A computational model of outguessing in two-player non-cooperative games