Computational aspects of assigning agents to a line
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Dokumenter
- Computational aspects of assigning agents to a line
Forlagets udgivne version, 382 KB, PDF-dokument
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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Mathematical Social Sciences |
Vol/bind | 90 |
Sider (fra-til) | 93-99 |
Antal sider | 7 |
ISSN | 0165-4896 |
DOI | |
Status | Udgivet - 2017 |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 178791743