Computational aspects of assigning agents to a line

Aziz, Haris;Hougaard, Jens Leth;Moreno-Ternero, Juan de Dios;Østerdal, Lars Peter
(2017) Mathematical Social Sciences — Vol. 90, p. 93-99 (2017)

Files

Rep2915.pdf
  • Closed Access
  • Adobe PDF
  • 970.83 KB
No access

Details

Authors
  • Aziz, Haris
    Author
  • Hougaard, Jens Leth
    Author
  • Moreno-Ternero, Juan de Dios
    Author
  • Østerdal, Lars Peter
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Aziz, H., Hougaard, J. L., Moreno-Ternero, J. d. 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 (Original work published 2017)