Computational aspects of assigning agents to a line

Haris Aziz, Jens Hougaard (), Juan Moreno-Ternero and Lars Peter Østerdal

Mathematical Social Sciences, 2017, vol. 90, issue C, 93-99

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.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489617300471
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Computational aspects of assigning agents to a line (2017)
Working Paper: Computational aspects of assigning agents to a line (2017)
Working Paper: Computational Aspects of Assigning Agents to a Line (2016)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:90:y:2017:i:c:p:93-99

DOI: 10.1016/j.mathsocsci.2017.02.004

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().