We study the problem of allocating heterogeneous indivisible tasks in a multi-object-demand model (i.e., each agent can be assigned multiple objects) where monetary transfers are allowed. Agents. costs for performing tasks are their private information and depend on what other tasks they are...

We investigate the implications of welfare lower bounds together with queue-efficiency and strategyproofness in the context of the queueing problem. As a consequence, we provide alternative characterizations of the k-pivotal mechanisms (Mitra and Mutuswami [13]). First, we introduce the...