Approximate random allocation mechanisms
From MaRDI portal
Recommendations
- The generalized random priority mechanism with budgets
- Competitive equilibrium in the random assignment problem
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- The object allocation problem with random priorities
- An equilibrium analysis of the probabilistic serial mechanism
Cited in
(20)- Random assignments of bundles
- A pessimist's approach to one-sided matching
- On the efficiency and optimality of random allocations
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results
- Interdistrict school choice: a theory of student assignment
- Assignment problems with complementarities
- Implementing randomized allocation rules with outcome-contingent transfers
- The object allocation problem with favoring upper ranks
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Constrained random matching
- Approximate efficiency in matching markets
- Derandomized Balanced Allocation
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- The generalized random priority mechanism with budgets
- Allocation with weak priorities and general constraints
- Aggregating randomized and vector valued allocations
- Randomized allocation processes
- Randomization with non-uniform allocations: fulfillment time distributions and bias properties
- Estimation of parameters for a scheme of random allocation
- Competitive equilibrium in the random assignment problem
This page was built for publication: Approximate random allocation mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382406)
