Ordinal Maximin Share Approximation for Goods

DOI10.1613/JAIR.1.13317MaRDI QIDQ5094017zbMATH OpenOpenAlexWikidataFDO

Authors Hadi Hosseini, Andrew Searns, 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

zbMATH Keywords

computational social systemsgame theory

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• An improved approximation algorithm for maximin shares
• Approximating maximin share allocations
• Fair enough: guaranteeing approximate maximin shares
• Approximation Algorithms for Computing Maximin Share Allocations

Cites work

• A physicist's approach to number partitioning
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A simple procedure for finding equitable allocations of indivisible goods
• Almost envy-freeness in group resource allocation
• An asymptotic fully polynomial time approximation scheme for bin covering.
• An improved approximation algorithm for maximin shares
• Approximation Algorithms for Computing Maximin Share Allocations
• Better approximation algorithms for bin covering
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Cake cutting algorithms for piecewise constant and piecewise uniform valuations
• Cake cutting really is not a piece of cake
• Competitive equilibrium with indivisible goods and generic budgets
• Efficient reallocation under additive and responsive preferences
• Fair Allocation of Indivisible Goods
• Fair allocation of indivisible goods: improvement
• Fair assignment of indivisible objects under ordinal preferences
• Fair enough: guaranteeing approximate maximin shares
• scientific article; zbMATH DE number 1488104 (Why is no real title available?)
• Improving Nash social welfare approximations of indivisible goods
• Maximin share allocations on cycles
• On a dual version of the one-dimensional bin packing problem
• On maximin share allocations in matroids
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Stable matchings and preferences of couples
• Strategy-proof, efficient, and nonbossy quota allocations
• The exact LPT-bound for maximizing the minimum completion time
• The rate of convergence to optimality of the LPT rule
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• Two simple algorithms for bin covering
• Welfare bounds in the cooperative production problem

Cited in

(3)

• Fair distribution of delivery orders
• Ordinal maximin guarantees for group fair division
• Class fairness in online matching

This page was built for publication: Ordinal Maximin Share Approximation for Goods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094017)