Some addition:
The second and third example I gave seem to be related to another
Markov-chain method studied by Giora Slutzki and Oscar Volij (Scoring of
web pages and tournaments - axiomatizations, Working paper, Iowa State
University, 2003. Cited after Giora Slutzki and Oscar Volij: Ranking
On Sun, 16 May 2004, Jobst Heitzig wrote:
Neutrality: Now this is something I did not understand yet.
Quote:
Neutrality requires that if two problems are such that the ranking
method cannot rank any player [that is, any option! JH] above another,
then the ranking method should still be
