egttools.utils¶
This python module contains some utility functions to find saddle points and plot gradients in 2 player, 2 strategy games.
Functions
Calculates the number of unique combinations given the required number of elements of each group, which should be given in List format in the slots_per_bin parameter. |
|
Compute the spectral gap of a Markov chain transition matrix. |
|
Calculates the stationary distribution of a Markov chain from its transition matrix. |
|
Calculates the stationary distribution of a Markov chain using a Schur decomposition. |
|
Outputs a generator that will generate an ordered list with the possible combinations of values with length. |
|
Compute eigenvalues from an ordinary or generalized eigenvalue problem. |
|
Finds whether a saddle point is stable or not. |
|
Returns a function which gives the payoff of strategy i against strategy j. |
|
Is x either sparse array or sparse matrix type? |
|
Compute Schur decomposition of a matrix. |
|
Identity matrix in sparse format. |
|
Find k eigenvalues and eigenvectors of the square matrix A. |
|
Solve the sparse linear system Ax=b, where b may be a vector or a matrix. |
|
This function transform a payoff matrix in full format to a pairwise format. |
|
Issue a warning, or maybe ignore it or raise an exception. |
Classes
Base class for all game-theoretic models in EGTtools. |
|
Base class for undirected graphs. |
|
Compressed Sparse Column matrix. |
|
Compressed Sparse Row matrix. |
|
This class provides a base class for all sparse array and matrix classes. |
|
This class provides a base class for all sparse matrix classes. |
Exceptions
Warning for exactly singular matrices. |