Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

## Uses of Class
edu.princeton.repeatedgames.rgsolve.polygon.GameExtremePoint

Packages that use GameExtremePoint
edu.princeton.repeatedgames.rgsolve | Contains the core classes of the rgsolve package, including the solver class `RGSolve`, the solver settings `AlgoParameters`, and data structures like `RGSolution` for storing game solutions and algorithm information.
edu.princeton.repeatedgames.rgsolve.components | WARNING: These classes are undocumented - Contains classes defining the components used in the rgsolve GUI.
edu.princeton.repeatedgames.rgsolve.games | Contains the `Game` class which defines a repeated game, and classes for constructing, manipulating and analyzing games.
edu.princeton.repeatedgames.rgsolve.polygon | Contains classes and methods used for storing and manipulating the polygons that define payoff sets - Includes a convex hull routine, and the class `GameExtremePoint`, which defines an equilibrium extreme point of V* and how it is generated.

Uses of GameExtremePoint in edu.princeton.repeatedgames.rgsolve

Fields in edu.princeton.repeatedgames.rgsolve declared as GameExtremePoint
`GameExtremePoint[]` | `RGSolution.V_star` The equilibrium payoff set V* (or final payoff set before algorithm terminated.
`(package private) GameExtremePoint[]` | `RGSolve.RecursiveActionLoop.W` the feasible continuation payoffs
`GameExtremePoint[]` | `RGIter.W` W is the payoff set at the *start* of this iteration

Fields in edu.princeton.repeatedgames.rgsolve with type parameters of type GameExtremePoint
`(package private) java.util.ArrayList<GameExtremePoint>` | `RGSolve.staticNashPayoffs` As a safety precaution, we add in the static pure strategy nash equilibria on every iteration to make sure we don't miss them

Methods in edu.princeton.repeatedgames.rgsolve that return GameExtremePoint
`GameExtremePoint[]` | `RGSolve.AbreuSannikovOperator(GameExtremePoint[] W, Point u, RGIter rg_iter)` This applies the Abreu-Sannikov (or APS) operator to a set.

Methods in edu.princeton.repeatedgames.rgsolve that return types with arguments of type GameExtremePoint
`java.util.List<GameExtremePoint>` | `RGSolve.RecursiveActionLoop.call()`
`private java.util.List<GameExtremePoint>` | `RGSolve.generateSupportedPayoffs(int startAct, int endAct, GameExtremePoint[] W, Point u, RGIter rg_iter, int xmin_n, int xmin_s, int ymin_e, int ymin_w, int xmax_n, int xmax_s, int ymax_e, int ymax_w, double minXVal, double maxXVal, double minYVal, double maxYVal)` A helper method within the Abreu-Sannikov (or APS) operator for calculating potential extreme points supported by actions in the range `startAct` to `endAct`.

Methods in edu.princeton.repeatedgames.rgsolve with parameters of type GameExtremePoint
`GameExtremePoint[]` | `RGSolve.AbreuSannikovOperator(GameExtremePoint[] W, Point u, RGIter rg_iter)` This applies the Abreu-Sannikov (or APS) operator to a set.
`private java.util.List<GameExtremePoint>` | `RGSolve.generateSupportedPayoffs(int startAct, int endAct, GameExtremePoint[] W, Point u, RGIter rg_iter, int xmin_n, int xmin_s, int ymin_e, int ymin_w, int xmax_n, int xmax_s, int ymax_e, int ymax_w, double minXVal, double maxXVal, double minYVal, double maxYVal)` A helper method within the Abreu-Sannikov (or APS) operator for calculating potential extreme points supported by actions in the range `startAct` to `endAct`.
`private static java.lang.String` | `RGSolveMathematica.getEquationSystem(Game game, GameExtremePoint[] V_star, int[] BR1, int[] BR2, RGSolveMathematica.SOFTWARE software)` Returns the command for the the software in `software`'s algebraic solver to find the exact solution to the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static java.lang.String` | `RGSolveMathematica.getLatexCommand(Game game, GameExtremePoint[] V_star)` Returns the LaTeX code for the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static java.lang.String` | `RGSolveMathematica.getLatexCommand(Game game, GameExtremePoint[] V_star, int[] BR1, int[] BR2)` Returns the LaTeX code for the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static java.lang.String` | `RGSolveMathematica.getMathematicaCommand(Game game, GameExtremePoint[] V_star)` Returns the Mathematica command for the Mathematica algebraic solver to find the exact solution to the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static java.lang.String` | `RGSolveMathematica.getMathematicaCommand(Game game, GameExtremePoint[] V_star, int[] BR1, int[] BR2)` Returns the Mathematica command for the Mathematica algebraic solver to find the exact solution to the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static java.lang.String` | `RGSolveMathematica.getMatlabCommand(Game game, GameExtremePoint[] V_star)` Returns the Matlab command for the Matlab algebraic solver to find the exact solution to the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static java.lang.String` | `RGSolveMathematica.getMatlabCommand(Game game, GameExtremePoint[] V_star, int[] BR1, int[] BR2)` Returns the Matlab command for the Matlab algebraic solver to find the exact solution to the system of equations defining V*, a system derived from the extreme points (and how they are generated) stored in `V_star`
`static Point` | `RGSolve.getPunishment(GameExtremePoint[] W, Point curPunishment)` Gets the current threat point given payoff set W and old threat point curPunishment

Constructors in edu.princeton.repeatedgames.rgsolve with parameters of type GameExtremePoint
`RGIter(int iter, boolean keepActions, int numActions, GameExtremePoint[] W, Point punishment, int numDrop_start, BitSetFixed usableActions)` Constructor: see field information
`RGSolution.RGSolutionUserRule(AlgoParameters.ALGO_TYPE algo_type, Point[] W0, GameExtremePoint[] V_star, Point punishment_star, int[] BR1, int[] BR2, int iters, long time_ms, boolean converged, double error, java.util.ArrayList<RGIter> iterList, int genPtsCount, boolean keptActions, AlgoParameters params, boolean fromInnerApproximation, GameCodeData gmcode)` Straightforward constructor; same as for `GameCodeData`, but it stores a `GameCodeData` object rather than a game.
`RGSolution(AlgoParameters.ALGO_TYPE algo_type, Point[] W0, GameExtremePoint[] V_star, Point punishment_star, Game game, int[] BR1, int[] BR2, int iters, long time_ms, boolean converged, double error, java.util.ArrayList<RGIter> iterList, int genPtsCount, boolean keptActions, boolean fromInnerApproximation, AlgoParameters params)` Default constructor for initializing fields of data structure
`RGSolve.RecursiveActionLoop(int startAct, int endAct, GameExtremePoint[] W, Point u, RGIter rg_iter, int xmin_n, int xmin_s, int ymin_e, int ymin_w, int xmax_n, int xmax_s, int ymax_e, int ymax_w, double minXVal, double maxXVal, double minYVal, double maxYVal)` A helper method within the Abreu-Sannikov (or APS) operator for calculating potential extreme points supported by actions in the range `startAct` to `endAct`.

Uses of GameExtremePoint in edu.princeton.repeatedgames.rgsolve.components

Fields in edu.princeton.repeatedgames.rgsolve.components declared as GameExtremePoint
`(package private) GameExtremePoint[]` | `SolutionGraph.V_star`

Methods in edu.princeton.repeatedgames.rgsolve.components with parameters of type GameExtremePoint
`void` | `SolutionGraph.enableContButtons(GameExtremePoint extPt)`

Uses of GameExtremePoint in edu.princeton.repeatedgames.rgsolve.games

Methods in edu.princeton.repeatedgames.rgsolve.games that return types with arguments of type GameExtremePoint
`static java.util.List<GameExtremePoint>` | `StageGameMethods.getFeasibleSetHull(Game gm, AlgoParameters params, boolean doMultiThread)` Computes and returns the convex hull of the set of feasible stage payoffs in the game `gm`.

Uses of GameExtremePoint in edu.princeton.repeatedgames.rgsolve.polygon

Methods in edu.princeton.repeatedgames.rgsolve.polygon that return GameExtremePoint
`GameExtremePoint` | `GameExtremePoint.getContraction(double g1, double g2, double discount)` This method contracts this point towards g=(g1,g2), i.e.

Methods in edu.princeton.repeatedgames.rgsolve.polygon with parameters of type GameExtremePoint
`boolean` | `GameExtremePointList.add(GameExtremePoint gep)` Overrides super.add(.) to prevent the addition of null references to the list

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES