Ordinal Maximin Share Approximation for Goods
From MaRDI portal
Publication:5094017
DOI10.1613/jair.1.13317OpenAlexW3198151025WikidataQ114050362 ScholiaQ114050362MaRDI QIDQ5094017
Andrew Searns, Hadi Hosseini, Erel Segal-Halevi
Publication date: 2 August 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.01925
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategy-proof, efficient, and nonbossy quota allocations
- Fair assignment of indivisible objects under ordinal preferences
- The rate of convergence to optimality of the LPT rule
- Welfare bounds in the cooperative production problem
- The exact LPT-bound for maximizing the minimum completion time
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- An asymptotic fully polynomial time approximation scheme for bin covering.
- On maximin share allocations in matroids
- Stable matchings and preferences of couples
- Almost envy-freeness in group resource allocation
- An improved approximation algorithm for maximin shares
- Efficient reallocation under additive and responsive preferences
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- A simple procedure for finding equitable allocations of indivisible goods
- Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
- On a dual version of the one-dimensional bin packing problem
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair Enough
- Fair Allocation of Indivisible Goods: Improvement
- Competitive Equilibrium with Indivisible Goods and Generic Budgets
- Improving Nash Social Welfare Approximations
- Maximin Share Allocations on Cycles
- Fair Allocation of Indivisible Goods
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Cake cutting really is not a piece of cake
- A physicist's approach to number partitioning
This page was built for publication: Ordinal Maximin Share Approximation for Goods
