Full Implementation of Rank Dependent Prizes

Abstract

A manager/mechanism designer must allocate a set of money prizes ($1, $2, .., $n) between n agents working in a team. The agents know the state i.e. who contributed most, second most, etc. The agents' prefer- ences over prizes are state independent. We incorporate the possibility that the manager knows the state with a tiny probability and present a simple mechanism that uniquely implement prizes that respects the true state.