Efficiency under a combination of ordinal and cardinal information on preferences
DOI10.1016/J.JMATECO.2011.02.001zbMATH Open1217.90130OpenAlexW2094705055MaRDI QIDQ553528FDOQ553528
Authors: Stergios Athanassoglou 
Publication date: 27 July 2011
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://ageconsearch.umn.edu/record/101288/files/NDL2011-011r.pdf
Recommendations
- Ordinal efficiency and the polyhedral separating hyperplane theorem
- Equivalence of efficiency notions for ordinal assignment problems
- An efficiency theorem for incompletely known preferences
- Ordinal efficiency and dominated sets of assignments.
- A solution to the random assignment problem on the full preference domain
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- A new solution to the random assignment problem.
- Ordinal efficiency and the polyhedral separating hyperplane theorem
- A solution to the random assignment problem on the full preference domain
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Why do popular mechanisms lack efficiency in random environments?
- A constructive proof of the ordinal efficiency welfare theorem
- An efficiency theorem for incompletely known preferences
- Ordinal efficiency and dominated sets of assignments.
- Random serial dictatorship and ordinally efficient contracts
Cited In (3)
This page was built for publication: Efficiency under a combination of ordinal and cardinal information on preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553528)
