Assignment Problem Based on Ordinal Preferences

DOI10.1287/mnsc.20.3.331zbMath0326.90006OpenAlexW1971278768MaRDI QIDQ4091669

Peter Gaerdenfors

Publication date: 1973

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.20.3.331

Mathematics Subject Classification ID

Decision theory (91B06) Utility theory (91B16)

Related Items (8)

Pareto Optimal Matchings in Many-to-Many Markets with Ties ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Impossibilities for probabilistic assignment ⋮ Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning ⋮ Pareto optimal matchings in many-to-many markets with ties ⋮ Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences ⋮ Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity ⋮ Size versus truthfulness in the house allocation problem

This page was built for publication: Assignment Problem Based on Ordinal Preferences