scientific article

zbMath1232.68178MaRDI QIDQ3549603

Arash Asadpour, Amin Saberi

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

max-min fair allocationindevisible goods

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (17)

Approximation Algorithms for Computing Maximin Share Allocations ⋮ Restricted max-min allocation: integrality gap and approximation algorithm ⋮ A truthful constant approximation for maximizing the minimum load on related machines ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ General max-min fair allocation ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ Santa Claus Meets Hypergraph Matchings ⋮ On-line machine covering on two machines with local migration ⋮ Fair division of indivisible items between two players: design parameters for contested pile methods ⋮ Restricted Max-Min Fair Allocation ⋮ Unnamed Item ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Fair Allocation of Indivisible Goods: Improvement ⋮ Semi-online machine covering for two uniform machines ⋮ Nash Social Welfare, Matrix Permanent, and Stable Polynomials ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Unnamed Item

This page was built for publication: