Assigning agents to a line

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Assigning agents to a line. / Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Østerdal, Lars Peter Raahave.

I: Games and Economic Behavior, Bind 87, 2014, s. 539–553.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Hougaard, JL, Moreno-Ternero, JD & Østerdal, LPR 2014, 'Assigning agents to a line', Games and Economic Behavior, bind 87, s. 539–553. https://doi.org/10.1016/j.geb.2014.02.011

APA

Hougaard, J. L., Moreno-Ternero, J. D., & Østerdal, L. P. R. (2014). Assigning agents to a line. Games and Economic Behavior, 87, 539–553. https://doi.org/10.1016/j.geb.2014.02.011

Vancouver

Hougaard JL, Moreno-Ternero JD, Østerdal LPR. Assigning agents to a line. Games and Economic Behavior. 2014;87:539–553. https://doi.org/10.1016/j.geb.2014.02.011

Author

Hougaard, Jens Leth ; Moreno-Ternero, Juan D. ; Østerdal, Lars Peter Raahave. / Assigning agents to a line. I: Games and Economic Behavior. 2014 ; Bind 87. s. 539–553.

Bibtex

@article{2ec2cd3142604128ba803bf340662c1d,
title = "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. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and assigned slots. We first consider deterministic assignment of agents to slots, and provide a direct method for testing if a given deterministic assignment is aggregate gap minimizing. We then consider probabilistic assignment of agents to slots, and make use of the previous method to propose an aggregate gap minimizing modification of the classic random priority method to solve this class of problems. We also provide some logical relations in our setting among standard axioms in the literature on assignment problems, and explore the robustness of our results to several extensions of our setting.",
author = "Hougaard, {Jens Leth} and Moreno-Ternero, {Juan D.} and {\O}sterdal, {Lars Peter Raahave}",
year = "2014",
doi = "10.1016/j.geb.2014.02.011",
language = "English",
volume = "87",
pages = "539–553",
journal = "Games and Economic Behavior",
issn = "0899-8256",
publisher = "Academic Press",

}

RIS

TY - JOUR

T1 - Assigning agents to a line

AU - Hougaard, Jens Leth

AU - Moreno-Ternero, Juan D.

AU - Østerdal, Lars Peter Raahave

PY - 2014

Y1 - 2014

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. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and assigned slots. We first consider deterministic assignment of agents to slots, and provide a direct method for testing if a given deterministic assignment is aggregate gap minimizing. We then consider probabilistic assignment of agents to slots, and make use of the previous method to propose an aggregate gap minimizing modification of the classic random priority method to solve this class of problems. We also provide some logical relations in our setting among standard axioms in the literature on assignment problems, and explore the robustness of our results to several extensions of our 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. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and assigned slots. We first consider deterministic assignment of agents to slots, and provide a direct method for testing if a given deterministic assignment is aggregate gap minimizing. We then consider probabilistic assignment of agents to slots, and make use of the previous method to propose an aggregate gap minimizing modification of the classic random priority method to solve this class of problems. We also provide some logical relations in our setting among standard axioms in the literature on assignment problems, and explore the robustness of our results to several extensions of our setting.

U2 - 10.1016/j.geb.2014.02.011

DO - 10.1016/j.geb.2014.02.011

M3 - Journal article

VL - 87

SP - 539

EP - 553

JO - Games and Economic Behavior

JF - Games and Economic Behavior

SN - 0899-8256

ER -

ID: 112937049