Probabilistic Strategies in Finite Games with Complete Information

DOI10.1137/1132074MaRDI QIDQ3813633zbMATH OpenOpenAlexFDO

Authors A. Kh. Shen'

Publication date 1987

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1132074

zbMATH Keywords

complete informationfinite polynomial gamesfinite two-person noncooperative gamesmixed polynomial strategyprobabilistic strategiespseudorandom binary sequences

Mathematics Subject Classification ID

2-person games (91A05)

Cited in

(4)

• Strategy-proof probabilistic rules for expected utility maximizers
• Probabilities within optimal strategies for tournament games
• Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information
• Pure Strategies in Imperfect Information Stochastic Games

This page was built for publication: Probabilistic Strategies in Finite Games with Complete Information

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