Uses of Package
edu.princeton.repeatedgames.rgsolve.polygon

Packages that use edu.princeton.repeatedgames.rgsolve.polygon
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. 
 

Classes in edu.princeton.repeatedgames.rgsolve.polygon used by edu.princeton.repeatedgames.rgsolve
GameExtremePoint
          This class extends the Point class.
 

Classes in edu.princeton.repeatedgames.rgsolve.polygon used by edu.princeton.repeatedgames.rgsolve.components
GameExtremePoint
          This class extends the Point class.
 

Classes in edu.princeton.repeatedgames.rgsolve.polygon used by edu.princeton.repeatedgames.rgsolve.games
GameExtremePoint
          This class extends the Point class.
 

Classes in edu.princeton.repeatedgames.rgsolve.polygon used by edu.princeton.repeatedgames.rgsolve.polygon
GameExtremePoint
          This class extends the Point class.
GameExtremePoint.CONSTRAINT
          An enum type for the player identity of binding incentive constraints
GameExtremePointList
          A custom ArrayList storing GameExtremePoint that does not allow the addition of null references to the list.
RobustConvexHull.ExtractSumObject
           
RobustConvexHull.PointComparator
          This object compares Point objects lexicographically, using the rule: p1 < p2 iff p1.x > p2.x || (p1.x == p2.x && p1.y < p2.y) This is the usual Lexicographic ordering except we have flipped the comparison on the x-coordinate; we want points ordered right-to-left.