Assignment Problem Based on Ordinal Preferences

DOI10.1287/MNSC.20.3.331zbMATH Open0326.90006OpenAlexW1971278768MaRDI QIDQ4091669FDOQ4091669

Authors: Peter Gärdenfors 

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)

Cited In (9)

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

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

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