Stanislav Zhydkov

PeerNomination: Relaxing Exactness for Increased Accuracy in Peer Selection

In peer selection agents must choose a subset of themselves for an award or a prize. As agents are self-interested, we want to design algorithms that are impartial, so that an individual agent cannot affect their own chance of being selected. This problem has broad application in resource allocation…