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

See:
Description

Interface Summary

RobustConvexHull.SignedAreaFunc

Interface for signed area calculator

Class Summary

GameExtremePoint	This class extends the Point class.
GameExtremePointList	A custom ArrayList storing GameExtremePoint that does not allow the addition of null references to the list.
PolygonMethods	This class contains methods for polygons, which are interpreted as arrays of Point that are sorted counter-clockwise
RobustConvexHull	Computes convex hull robustly using Andrew's Monotone Chain algorithm (based on C++ code found here: http://www.algorithmist.com/index.php/Monotone_Chain_Convex_Hull.cpp), with robustness checks from the literature.
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.

Enum Summary

GameExtremePoint.CONSTRAINT

An enum type for the player identity of binding incentive constraints

Package edu.princeton.repeatedgames.rgsolve.polygon Description

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.