Efficiency under a combination of ordinal and cardinal information on preferences
Abstract Consider a collection of m indivisible objects to be allocated to n agents, where m>=n. Each agent falls in one of two distinct categories: either he (a) has a complete ordinal ranking over the set of individual objects, or (b) has a set of "plausible" benchmark von Neumann-Morgenstern (vNM) utility functions in whose positive span his "true" utility is known to lie. An allocation is undominated if there does not exist a preference-compatible profile of vNM utilities at which it is Pareto dominated by another feasible allocation. Given an undominated allocation, we use the tools of linear duality theory to construct a profile of vNM utilities at which it is ex-ante welfare maximizing. A finite set of preference-compatible vNM utility profiles is exhibited such that every undominated allocation is ex-ante welfare maximizing with respect to at least one of them. Given an arbitrary allocation, we provide an interpretation of the constructed vNM utilities as subgradients of a function which measures worst-case domination.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- Yeon-Koo Che & Fuhito Kojima, 2010.
"Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms,"
Econometric Society, vol. 78(5), pages 1625-1672, 09.
- Yeon-Koo Che & Fuhito Kojima, 2008. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Cowles Foundation Discussion Papers 1677, Cowles Foundation for Research in Economics, Yale University.
- Carroll, Gabriel, 2010. "An efficiency theorem for incompletely known preferences," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2463-2470, November.
- Mihai Manea, 2008. "Random serial dictatorship and ordinally efficient contracts," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 489-496, March.
- McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
- Manea, Mihai, 2008. "A constructive proof of the ordinal efficiency welfare theorem," Journal of Economic Theory, Elsevier, vol. 141(1), pages 276-281, July.
- Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
- Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
- Manea, Mihai, 2009. "Asymptotic ordinal inefficiency of random serial dictatorship," Theoretical Economics, Econometric Society, vol. 4(2), June.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:47:y:2011:i:2:p:180-185. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.