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

Class MinMax

java.lang.Object

burlap.behavior.stochasticgames.agents.twoplayer.singlestage.equilibriumplayer.BimatrixEquilibriumSolver

burlap.behavior.stochasticgames.agents.twoplayer.singlestage.equilibriumplayer.equilibriumsolvers.MinMax

public class MinMax
extends BimatrixEquilibriumSolver

Finds the MinMax equilibrium using linear programming and returns the appropraite strategy. Note that if the game is not zero sum, the resulting strategy produced will be as if it was by setting the opponent's payoff matrix to the the negation of the querying player.

Author:

James MacGlashan

Field Summary

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

doubleEpislon, lastColPlayerPayoff, lastColsStrategy, lastRowPlayerPayoff, lastRowStrategy

Constructor Summary

Constructors

Constructor and Description
MinMax()

Method Summary

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.stochasticgames.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

MinMax

public MinMax()

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.