Approximate Random Allocation Mechanisms
From MaRDI portal
Publication:3382406
DOI10.1093/restud/rdz066zbMath1471.91195OpenAlexW3124800553WikidataQ126419049 ScholiaQ126419049MaRDI QIDQ3382406
Afshin Nikzad, Mohammad Akbarpour
Publication date: 21 September 2021
Published in: The Review of Economic Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/restud/rdz066
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68) Mechanism design theory (91B03)
Related Items (10)
Interdistrict school choice: a theory of student assignment ⋮ Assignment problems with complementarities ⋮ Allocation with Weak Priorities and General Constraints ⋮ Constrained random matching ⋮ The vigilant eating rule: a general approach for probabilistic economic design with constraints ⋮ Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results ⋮ The object allocation problem with favoring upper ranks ⋮ Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms ⋮ Random assignments of bundles ⋮ A pessimist's approach to one-sided matching
This page was built for publication: Approximate Random Allocation Mechanisms
