Probabilistic Strategies in Finite Games with Complete Information
Ao Shen · Theory of Probability and Its Applications · 1988
Previous article Next article Probabilistic Strategies in Finite Games with Complete InformationA. Kh. Shen’A. Kh. Shen’https://doi.org/10.1137/1132074PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Manuel Blum and , Silvio Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput., 13 (1984), 850–864 10.1137/0213053 86a:68021 0547.68046 LinkGoogle Scholar[2] A. Shamir, , R. L. Rivest and , L. M. Adleman, Mental pokerThe Mathematical Gardner, Wadsworth, Belmont, CA, 1981, 37–43 CrossrefGoogle Scholar[3] G. M. Adel'son-Vel'skii, , V. L. Arlazarov and , M. V. Donskii, Programming of Games, Nauka, Moscow, 1978, (In Russian.) Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Volume 32, Issue 3| 1988Theory of Probability & Its Applications History Submitted:17 April 1987Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1132074Article page range:pp. 516-518ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics