ACM Transactions on Computational Logic · 2002 · 80 citations · 19 references
Social SciencesComputer ScienceMathematicsGame TheoryProbability TheoryUncertainty QuantificationBayesian GamesNoncooperative Game TheoryAbstract Model ConstructionBayesian Game TheoryGame CategoriesGame-theoretic SemanticsProbabilistic ComputationProbabilistic Semantics
A category of HO/N-style games and probabilistic strategies is developed where the possible choices of a strategy are quantified so as to give a measure of the likelihood of seeing a given play. A two-sided die is shown to be universal in this category, in the sense that any strategy breaks down into a composition between some deterministic strategy and that die. The interpretative power of the category is then demonstrated by delineating a Cartesian closed subcategory that provides a fully abstract model of a probabilistic extension of Idealized Algol.
19
On Full Abstraction for PCF: I, II, and III
J. M. E. Hyland, C.-H. Luke Ong · Information and Computation · 2000 · 646 citations · Full text
A probabilistic powerdomain of evaluations
C Jones, Gordon Plotkin · 2003 · 350 citations
Bisimulation for Labelled Markov Processes
Information and Computation · 2002 · 307 citations
A fully abstract game semantics for general references
Samson Abramsky, Kohei Honda, Guy McCusker · 2002 · 201 citations · Full text