mixed-strategies: Find optimal mixed strategies for two-player games

[ library, math, mit, program ] [ Propose Tags ]

A Haskell implementation of the method of Chapter 6 of The Compleat Strategyst (J.D. Williams, McGraw-Hill 1955) for finding optimal mixed strategies for two-player hidden information games given a payoff matrix.


  • Data
    • Data.MixedStrategies


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS]
Dependencies array (>=0.4 && <0.5), base (>=4.5 && <4.6), containers (>=0.5 && <0.6), mixed-strategies, simple-tabular (>=0.1 && <0.2) [details]
License MIT
Author Bart Massey
Maintainer bart@cs.pdx.edu
Category Math
Home page http://wiki.cs.pdx.edu/bartforge/oms
Source repo head: git clone http://github.com/BartMassey/mixed-strategies.git
this: git clone http://github.com/BartMassey/mixed-strategies.git(tag v0.1)
Uploaded by BartonMassey at 2012-12-14T09:10:03Z
Reverse Dependencies 1 direct, 0 indirect [details]
Executables oms
Downloads 1050 total (1 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-22 [all 7 reports]