Ordinal Maximin Share Approximation for Goods (Q5094017): Difference between revisions

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