We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. We introduce a general approach to compute aggregate gap-minimizing assignments, as well as gap-egalitarian assignments. The approach relies on an algorithm which is shown to be faster than general purpose algorithms for the assignment problem. We also extend the approach to probabilistic assignments and explore the computational features of existing, as well as new, methods for this setting.
Aziz, H., Hougaard, J. L., Moreno-Ternero, J. D., & Østerdal, L. P. (2017). Computational aspects of assigning agents to a line. Mathematical Social Sciences, 90, 93–99. https://doi.org/10.1016/j.mathsocsci.2017.02.004