appeal to unanimity.

The PeerRank rules also satisfies a no dummy axiom since every agent has some influence over the final grade.

There exist two grade matrices which differ in just the grades assigned by one agent for which PeerRank returns different final grades.

[[**Proof:  **]{}\
]{}Consider the grade matrix in which every agent gives the maximum grade of 1 to every other agent, and the grade matrix which is identical except agent $i$ gives every agent the minimum grade of 0. Then PeerRank gives a grade of 1 to agent $i$ in the first case and 0 in the second. Hence $i$ is not a dummy.

The PeerRank rules also satisfies a simple symmetry axiom.

If we swap the grades of two agents and the grades that the two agents are given then the PeerRank rule swaps the grades assigned to the two agents.

It is also interesting to identify properties that the PeerRank rule does not have. For example, it is not impartial. Your grades of others do affect your own final grade. As a second example, it is not anonymous. It does matter who gives you a grade. It is better to get a good grade from 