Assigning agents to a line

DOI10.1016/J.GEB.2014.02.011MaRDI QIDQ485809zbMATH OpenOpenAlexFDO

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

Publication date 14 January 2015

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.geb.2014.02.011

zbMATH Keywords

random prioritysd-efficiencybottleneckprobabilistic assignmentaggregate gap minimizing

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Spatial models in economics (91B72)

Recommendations

• Computational aspects of assigning agents to a line
• Reallocating multiple facilities on the line
• Linear assignment procedures
• scientific article; zbMATH DE number 4074792
• Assignment flows
• Agent scheduling in a multiskill call center
• On lineations

Cites work

• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• scientific article; zbMATH DE number 1256696 (Why is no real title available?)
• scientific article; zbMATH DE number 1033392 (Why is no real title available?)
• A constructive proof of the ordinal efficiency welfare theorem
• A new solution to the random assignment problem.
• A simple random assignment problem with a unique solution
• A solution to the random assignment problem on the full preference domain
• Assigning agents to a line
• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
• College Admissions and the Stability of Marriage
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Incentives in the probabilistic serial mechanism
• On a conjecture by Gale about one-sided matching problems
• Ordinal efficiency and dominated sets of assignments.
• Ordinal efficiency and the polyhedral separating hyperplane theorem
• Probabilistic assignment of indivisible goods with single-peaked preferences
• Probabilistic assignment of objects: characterizing the serial rule
• Random Matching Under Dichotomous Preferences
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Random assignment under weak preferences
• Scheduling with Opting Out: Improving upon Random Priority
• The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
• Time-shared Systems
• Two axiomatic approaches to the probabilistic serial mechanism
• Two special cases of the assignment problem
• Why do popular mechanisms lack efficiency in random environments?

Cited in

(7)

• A graph theoretic approach to the slot allocation problem
• On slots' scheduling
• A characterization of the Vickrey rule in slot allocation problems
• Recent developments in the queueing problem
• Computational aspects of assigning agents to a line
• Fairness in temporal slot assignment
• Assigning agents to a line

This page was built for publication: Assigning agents to a line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485809)