Ordinal Maximin Share Approximation for Goods

Cites Work

An asymptotic fully polynomial time approximation scheme for bin covering.
Better approximation algorithms for bin covering
On a dual version of the one-dimensional bin packing problem
Strategy-proof, efficient, and nonbossy quota allocations
Bounds for Certain Multiprocessing Anomalies
Bounds on Multiprocessing Timing Anomalies
Stable matchings and preferences of couples
The exact LPT-bound for maximizing the minimum completion time
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
Improving Nash Social Welfare Approximations
A simple procedure for finding equitable allocations of indivisible goods
Fair Allocation of Indivisible Goods
Title not available (Why is that?)
The rate of convergence to optimality of the LPT rule
The undercut procedure: an algorithm for the envy-free division of indivisible items
An improved approximation algorithm for maximin shares
Approximation Algorithms for Computing Maximin Share Allocations
Welfare bounds in the cooperative production problem
Two simple algorithms for bin covering
A physicist's approach to number partitioning
Fair Enough
Fair assignment of indivisible objects under ordinal preferences
Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
Fair Allocation of Indivisible Goods: Improvement
On maximin share allocations in matroids
Efficient reallocation under additive and responsive preferences
Competitive Equilibrium with Indivisible Goods and Generic Budgets
Maximin Share Allocations on Cycles
Cake cutting really is not a piece of cake
Almost envy-freeness in group resource allocation

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)