Description Usage Arguments Details Value
Will find the pareto set in a two dimensional spatial voting model given a set of ideal points.
1 | findParetoSet(idealPoints)
|
idealPoints |
A numberOfVoters x numberOfDimensions matrix of ideal points. |
The pareto set of a set of ideal points is the convex hull of that set of alternatives. This function will take a set of ideal points and returns their convex hull as a matrix of points. The points are listed down the rows in clockwise or counterclockwise order with the first and last element in the matrix being the same ideal point.
The set of points that constitutes the pareto set of the set of alternatives. The points are listed down the rows in clockwise or counterclockwise order with the first and last element in the matrix being the same ideal point.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.