Computational Aspects of Assigning Agents to a Line

Haris Aziz, Jens Leth Hougaard, Juan D. Moreno-Ternero, Lars Peter Østerdal

Research output: Contribution to journalJournal articleResearchpeer-review

178 Downloads (Pure)

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.
Original languageEnglish
JournalMathematical Social Sciences
Volume86
Pages (from-to)68-74
Number of pages7
ISSN0165-4896
DOIs
Publication statusPublished - Nov 2017

Cite this