# Plot rankings on a permutation polytope of 3 o 4 objects containing all possible ties

### Description

Plot rankings a permutation polytope that is the geometrical space of preference rankings. The plot is available for 3 or for 4 objects

### Usage

1 |

### Arguments

`X` |
the sample of rankings, most of the time as returned by tabulaterows |

`L` |
labels of the objects |

`Wk` |
frequency associated to each ranking |

`nobj` |
number of objects: 3 or 4 |

### Details

polyplot() plots the universe of 3 objecys. polyplot(nobj=4) plots the universe of 4 objecys.

### Author(s)

Antonio D'Ambrosio <antdambr@unina.it> and Sonia Amodio <sonia.amodio@unina.it>

### References

Thompson, G. L. (1993). Generalized permutation polytopes and exploratory graphical methods for ranked data. The Annals of Statistics, 1401-1430.

Heiser, W. J., & D'Ambrosio, A. (2013). Clustering and prediction of rankings within a Kemeny distance framework. In Algorithms from and for Nature and Life (pp. 19-31). Springer International Publishing.

### See Also

tabulaterows

### Examples

1 2 3 4 5 6 7 |