public class MaxMax extends BimatrixEquilibriumSolver
computeRowStrategy(double[][], double[][]) method will return a strategy that always plays aciton
i. If there are ties for the maximum with different row actions, then the strategy returns is uniformly random
among the ties. The computeColStrategy(double[][], double[][]) does the same, except for the colPayoff matrix
and for column actions.doubleEpislon, lastColPlayerPayoff, lastColsStrategy, lastRowPlayerPayoff, lastRowStrategy| Constructor and Description |
|---|
MaxMax() |
| Modifier and Type | Method and Description |
|---|---|
double[] |
computeColStrategy(double[][] rowPayoff,
double[][] colPayoff)
Computes and returns the column player strategy for the given bimatrix game.
|
double[] |
computeRowStrategy(double[][] rowPayoff,
double[][] colPayoff)
Computes and returns the row player strategy for the given bimatrix game.
|
bimatrixEqualsLast, doubleEquality, getLastComputedColStrategy, getLastComputedRowStrategy, solvepublic double[] computeRowStrategy(double[][] rowPayoff,
double[][] colPayoff)
BimatrixEquilibriumSolvercomputeRowStrategy in class BimatrixEquilibriumSolverrowPayoff - the row player payoffs.colPayoff - the column player payoffs.public double[] computeColStrategy(double[][] rowPayoff,
double[][] colPayoff)
BimatrixEquilibriumSolvercomputeColStrategy in class BimatrixEquilibriumSolverrowPayoff - the row player payoffs.colPayoff - the column player payoffs.