Computational aspects of assigning agents to a line

Research output: Contribution to journalJournal articlepeer-review

Standard

Computational aspects of assigning agents to a line. / Aziz, Haris; Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Østerdal, Lars Peter Raahave.

In: Mathematical Social Sciences, Vol. 90, 2017, p. 93-99.

Research output: Contribution to journalJournal articlepeer-review

Harvard

Aziz, H, Hougaard, JL, Moreno-Ternero, JD & Østerdal, LPR 2017, 'Computational aspects of assigning agents to a line', Mathematical Social Sciences, vol. 90, pp. 93-99. https://doi.org/10.1016/j.mathsocsci.2017.02.004

APA

Aziz, H., Hougaard, J. L., Moreno-Ternero, J. D., & Østerdal, L. P. R. (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

Vancouver

Aziz H, Hougaard JL, Moreno-Ternero JD, Østerdal LPR. Computational aspects of assigning agents to a line. Mathematical Social Sciences. 2017;90:93-99. https://doi.org/10.1016/j.mathsocsci.2017.02.004

Author

Aziz, Haris ; Hougaard, Jens Leth ; Moreno-Ternero, Juan D. ; Østerdal, Lars Peter Raahave. / Computational aspects of assigning agents to a line. In: Mathematical Social Sciences. 2017 ; Vol. 90. pp. 93-99.

Bibtex

@article{f6299b5fdc414acd8a4db7fe7010e63f,
title = "Computational aspects of assigning agents to a line",
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.",
author = "Haris Aziz and Hougaard, {Jens Leth} and Moreno-Ternero, {Juan D.} and {\O}sterdal, {Lars Peter Raahave}",
year = "2017",
doi = "10.1016/j.mathsocsci.2017.02.004",
language = "English",
volume = "90",
pages = "93--99",
journal = "Mathematical Social Sciences",
issn = "0165-4896",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Computational aspects of assigning agents to a line

AU - Aziz, Haris

AU - Hougaard, Jens Leth

AU - Moreno-Ternero, Juan D.

AU - Østerdal, Lars Peter Raahave

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

U2 - 10.1016/j.mathsocsci.2017.02.004

DO - 10.1016/j.mathsocsci.2017.02.004

M3 - Journal article

VL - 90

SP - 93

EP - 99

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

SN - 0165-4896

ER -

ID: 178791743