Computational aspects of assigning agents to a line

DOI10.1016/j.mathsocsci.2017.02.004zbMath1415.91172OpenAlexW2598782820MaRDI QIDQ1680103

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

Publication date: 22 November 2017

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2017.02.004

zbMATH Keywords

probabilistic assignmentsassigning agentsgap-egalitarian assignmentsgap-minimizing assignments

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Cites Work

• Assigning agents to a line
• A solution to the random assignment problem on the full preference domain
• Equitable distribution of indivisible objects
• Ordinal efficiency and dominated sets of assignments.
• Assigning papers to referees
• On a conjecture by Gale about one-sided matching problems
• A graph theoretic approach to the slot allocation problem
• Pareto optimality in coalition formation
• Probabilistic assignment of indivisible goods with single-peaked preferences
• Assignment Problems
• Fair Allocation of Indivisible Goods
• A new solution to the random assignment problem.

This page was built for publication: Computational aspects of assigning agents to a line