burlap.behavior.stochasticgame.agents.twoplayer.singlestage.equilibriumplayer.equilibriumsolvers

Class MaxMax

• ```public class MaxMax
extends BimatrixEquilibriumSolver```
A class for finding a stategy that maxmizes the player's payoff under the assumption that their "opponent" is friendly and will try to do the same. This amounts to finding the joint aciton that has the maximum payoff for the query player and playing the corresponding action. For example, if rowPayoff[i][j] is the maximum element in the matrix, the `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.
Author:
James MacGlashan

• Fields inherited from class burlap.behavior.stochasticgame.agents.twoplayer.singlestage.equilibriumplayer.BimatrixEquilibriumSolver

`doubleEpislon, lastColPlayerPayoff, lastColsStrategy, lastRowPlayerPayoff, lastRowStrategy`
• Constructor Summary

Constructors
Constructor and Description
`MaxMax()`
• Method Summary

Methods
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.
• Methods inherited from class burlap.behavior.stochasticgame.agents.twoplayer.singlestage.equilibriumplayer.BimatrixEquilibriumSolver

`bimatrixEqualsLast, doubleEquality, getLastComputedColStrategy, getLastComputedRowStrategy, solve`
• Methods inherited from class java.lang.Object

`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`
• Constructor Detail

• MaxMax

`public MaxMax()`
• Method Detail

• computeRowStrategy

```public double[] computeRowStrategy(double[][] rowPayoff,
double[][] colPayoff)```
Description copied from class: `BimatrixEquilibriumSolver`
Computes and returns the row player strategy for the given bimatrix game. The strategy is represented as a double array where a[i] is the probability of action i being selected.
Specified by:
`computeRowStrategy` in class `BimatrixEquilibriumSolver`
Parameters:
`rowPayoff` - the row player payoffs.
`colPayoff` - the column player payoffs.
Returns:
the row player strategy.
• computeColStrategy

```public double[] computeColStrategy(double[][] rowPayoff,
double[][] colPayoff)```
Description copied from class: `BimatrixEquilibriumSolver`
Computes and returns the column player strategy for the given bimatrix game. The strategy is represented as a double array where a[i] is the probability of action i being selected.
Specified by:
`computeColStrategy` in class `BimatrixEquilibriumSolver`
Parameters:
`rowPayoff` - the row player payoffs.
`colPayoff` - the column player payoffs.
Returns:
the column player strategy.