Computational aspects of assigning agents to a line
type: Item
instance of: scholarly article
title: Computational aspects of assigning agents to a line
zbMATH Open document ID: 1415.91172
author: Haris Aziz
author: Jens Leth Hougaard
author: Juan D. Moreno-Ternero
author: Lars Peter Østerdal
published in: Mathematical Social Sciences
publication date: 2017-11-22T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91B68
Mathematics Subject Classification ID: 91-04
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6811246
zbMATH Keywords: assigning agents
zbMATH Keywords: gap-minimizing assignments
zbMATH Keywords: gap-egalitarian assignments
zbMATH Keywords: probabilistic assignments
MaRDI profile type: Publication
full work available at URL: j.mathsocsci.2017.02.004
OpenAlex ID: W2598782820
cites work: Ordinal efficiency and dominated sets of assignments.
cites work: Pareto optimality in coalition formation
cites work: A new solution to the random assignment problem.
cites work: Fair Allocation of Indivisible Goods
cites work: Assignment Problems
cites work: A graph theoretic approach to the slot allocation problem
cites work: Equitable distribution of indivisible objects
cites work: Assigning papers to referees
cites work: Assigning agents to a line
cites work: Probabilistic assignment of indivisible goods with single-peaked preferences
cites work: A solution to the random assignment problem on the full preference domain
cites work: On a conjecture by Gale about one-sided matching problems
DOI: 10.1016/J.MATHSOCSCI.2017.02.004
description: scientific article; zbMATH DE number 6811246