A constructive proof of the ordinal efficiency welfare theorem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- On cores and indivisibility
- Ordinal efficiency and dominated sets of assignments.
- Ordinal efficiency and the polyhedral separating hyperplane theorem
- Random serial dictatorship and ordinally efficient contracts
Cited in
(15)- Efficiency and stability of probabilistic assignments in marriage problems
- An efficiency theorem for incompletely known preferences
- Popular mixed matchings
- Efficiency under a combination of ordinal and cardinal information on preferences
- Incentives in the probabilistic serial mechanism
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
- Simultaneous eating algorithm and greedy algorithm in assignment problems
- An equilibrium analysis of the probabilistic serial mechanism
- Random assignment of multiple indivisible objects
- Efficient rules for probabilistic assignment
- Fair solutions to the random assignment problem
- Assigning agents to a line
- Welfare theorems for random assignments with priorities
- On endowments and indivisibility: partial ownership in the Shapley-Scarf model
- Universal Pareto dominance and welfare for plausible utility functions
This page was built for publication: A constructive proof of the ordinal efficiency welfare theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q938066)
