mixed-strategies alternatives and similar packages
Based on the "Math" category.
Alternatively, view mixed-strategies alternatives based on common mentions on social networks and blogs.
-
-
vector
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework . -
-
-
hgeometry
HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two focusses are: (1) Strong type safety, and (2) implementations of geometric algorithms and data structures that have good asymptotic running time guarantees. -
-
dimensional
Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+). -
-
-
numhask
A haskell numeric prelude, providing a clean structure for numbers and operations that combine them. -
-
-
poly
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent) -
-
-
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms.
InfluxDB - Power Real-Time Data Analytics at Scale
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of mixed-strategies or a related project?
README
Mixed Strategies
Copyright © 2012 Bart Massey
This Haskell code, given a payoff matrix, calculates an optimal mixed strategy for a two-player zero-sum single-round iterated simultaneous game.
The code follows the method of Chapter 6 of J.D. Williams's classic book The Compleat Strategyst (McGraw-Hill 1954). You might want to have a copy of that book handy to help in understanding some of the details of the API.
The code is in two parts. A library module,
Data.MixedStrategy, provides most of the calculating and
API functionality. A small driver program, oms, reads a
payoff matrix from standard input and writes a solution
trace to standard output. The examples directory contains
several examples, including two from The Compleat
Strategyst used to validate the implementation.
Everything builds fine using cabal.
This program is licensed under the "MIT License". Please
see the file COPYING in the source distribution of this
software for license terms.
*Note that all licence references and agreements mentioned in the mixed-strategies README section above
are relevant to that project's source code only.