A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic...

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...