Assignment Problem Based on Ordinal Preferences

DOI10.1287/MNSC.20.3.331MaRDI QIDQ4091669zbMATH OpenOpenAlexFDO

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)

• Impossibilities for probabilistic assignment
• 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
• 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
• Pareto optimal matchings in many-to-many markets with ties
• Game-theoretically secure protocols for the ordinal random assignment problem
• Fair assignment of indivisible objects under ordinal preferences

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)