This paper provides new proofs for some properties of the instant runoff voting rule, namely clone-proofness and strict social disappointment criterion. We show that instant runoff voting, contrary to most voting protocols, is not only immune to the strategic nomination, but also does not...

We introduce ex-ante Pareto efficiency, which is a slightly weaker notion of efficiency than ex-post Pareto efficiency. We strengthen the impossibility between ex-post Pareto efficiency, strategyproofness, and envy-freeness in the random assignment problem and show that it prevails if ex-post...

A random assignment is rank-minimizing if it has the minimum average rank of objects for agents among all possible assignments. We show that a rank-minimizing random assignment is rank efficient, in the sense of Featherstone (2020). Moreover, we propose a mechanism called the Random...