Probabilistic analysis of simulation-based games

DOI10.1145/1842713.1842719zbMATH Open1386.91023OpenAlexW2023986907MaRDI QIDQ4635154FDOQ4635154

Authors: Yevgeniy Vorobeychik 

Publication date: 16 April 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1842713.1842719

Recommendations

• Probabilistic Techniques in Algorithmic Game Theory
• Nonparametric probability bounds for Nash equilibrium actions in a simultaneous discrete game
• Empirical game theoretic models: Computational issues
• Mean field equilibrium in dynamic games with strategic complementarities
• Algorithmic rationality: game theory with costly computation

zbMATH Keywords

simulationgame theorymodelingNash equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) Game theory (91A99) Games with infinitely many players (91A07)

Cited In (8)

• Augmented probability simulation methods for sequential games
• Signal extraction for simulated games with a large number of players
• A procedure for analyzing hypergames
• Exploiting extensive-form structure in empirical game-theoretic analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• A probabilistic analysis of the Game of the Goose
• Stochastic Nash equilibrium problems: sample average approximation and applications

This page was built for publication: Probabilistic analysis of simulation-based games

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