Cres, Hervé; Moulin, Hervé - 2007
In a scheduling problem where agents can opt out, we show that the familiar Random Priority (RP)a rule can be improved upon by another mechanism dubbed Probabilistic Serial (PS). Both mechanisms are nonmanipulable in a strong sense, but the latter is Pareto superior to the former and serves a...