Flow shops are well-studied machine environments in which all jobs must visit all machines in the same order. While conventional flow shops assume that each job traverses the shop only once, many industrial environments require jobs to loop through the shop multiple times before completion. This...

We consider the problem of allocating a single object to the agents with payments. Agents have preferences that are not necessarily quasi-linear. We characterize the class of rules satisfying pairwise strategy-proofness and non-imposition by the priority rule. Our characterization result remains...

We consider the problem of allocating a single object to the agents with payments. Agents have preferences that are not necessarily quasi-linear. We characterize the class of rules satisfying pairwise strategy-proofness and non-imposition by the priority rule. Our characterization result remains...