Ordinal efficiency and the polyhedral separating hyperplane theorem
From MaRDI portal
Recommendations
- Separating hyperplanes for convex sets over ordered fields
- On the complexity of polyhedral separability
- Polyhedral separability through successive LP
- On the order dimension of convex polytopes
- An ordinal indexed hierarchy of separation properties
- Effective separability of positive and negative linear orders
- The Order Dimension of Convex Polytopes
- POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING
- An algorithmic separating hyperplane theorem and its applications
- Multidimensional inequality and inframodular order
Cites work
- A new solution to the random assignment problem.
- A simple random assignment problem with a unique solution
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- Lectures on Polytopes
- On a conjecture by Gale about one-sided matching problems
- On cores and indivisibility
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Scheduling with Opting Out: Improving upon Random Priority
- Selected papers. Ed. by David Cantor, Basil Gordon, Bruce Rothschild
- Weak versus strong domination in a market with indivisible goods
Cited in
(36)- Random assignment of multiple indivisible objects
- Random assignment under weak preferences
- Ordinal efficiency and dominated sets of assignments.
- Fair solutions to the random assignment problem
- Equivalence of efficiency notions for ordinal assignment problems
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
- Strategic candidacy for multivalued voting procedures
- Trading probabilities along cycles
- On endowments and indivisibility: partial ownership in the Shapley-Scarf model
- Welfare theorems for random assignments with priorities
- Foundations of pseudomarkets: Walrasian equilibria for discrete resources
- On the terminology of economic design: a critical assessment and some proposals
- Efficient rules for probabilistic assignment
- A strict expected multi-utility theorem
- Random serial dictatorship and ordinally efficient contracts
- Convex strategyproofness with an application to the probabilistic serial mechanism
- An equilibrium analysis of the probabilistic serial mechanism
- Scalarization methods and expected multi-utility representations
- Assigning agents to a line
- Efficiency under a combination of ordinal and cardinal information on preferences
- Efficiency and stability of probabilistic assignments in marriage problems
- Optimal assignment mechanisms with imperfect verification
- Strategy-proof and envy-free random assignment
- Simultaneous eating algorithm and greedy algorithm in assignment problems
- An efficiency theorem for incompletely known preferences
- Empirical welfare economics
- On (constrained) efficiency of strategy-proof random assignment
- Consistency in the probabilistic assignment model
- Pareto-optimal linear programming
- Decomposition envy-freeness in random assignment
- Universal Pareto dominance and welfare for plausible utility functions
- Why do popular mechanisms lack efficiency in random environments?
- Incentives in the probabilistic serial mechanism
- A solution to the random assignment problem on the full preference domain
- A constructive proof of the ordinal efficiency welfare theorem
- The probabilistic serial mechanism with private endowments
This page was built for publication: Ordinal efficiency and the polyhedral separating hyperplane theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697847)
