The mixed-strategies package

[ Tags: 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.


Dependencies array (==0.4.*), base (==4.5.*), containers (==0.5.*), mixed-strategies, simple-tabular (==0.1.*) [details]
License MIT
Author Bart Massey
Category Math
Home page
Source repo head: git clone
this: git clone v0.1)
Uploaded Fri Dec 14 09:10:03 UTC 2012 by BartonMassey
Distributions NixOS:
Executables oms
Downloads 473 total (5 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-22 [all 7 reports]
Hackage Matrix CI


  • Data
    • Data.MixedStrategies


Maintainer's Corner

For package maintainers and hackage trustees