Computing fair and efficient allocations with few utility values

DOI10.1007/978-3-030-85947-3_23MaRDI QIDQ2670939zbMATH OpenOpenAlexFDO

Authors Jugal Garg, Aniket Murhekar

Publication date 1 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-85947-3_23

zbMATH Keywords

EFXEQXfair and efficient allocationNash welfare

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Maximum Nash welfare and other stories about EFX
• Generalized binary utility functions and fair allocations
• Almost envy-freeness with general valuations
• Almost envy-freeness with general valuations
• Finding fair and efficient allocations when valuations don't add up

Cites work

• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Almost envy-freeness with general valuations
• Approximating the Nash social welfare with budget-additive valuations
• Approximating the Nash social welfare with indivisible items
• APX-hardness of maximizing Nash social welfare with indivisible items
• Efficient reallocation under additive and responsive preferences
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• Improving Nash social welfare approximations of indivisible goods
• Maximizing Nash product social welfare in allocating indivisible goods
• Maximum Nash welfare and other stories about EFX
• Microeconomic theory
• Near fairness in matroids
• On (1,)-restricted assignment makespan minimization
• On fair division for indivisible items
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• Random Matching Under Dichotomous Preferences
• Sur la division pragmatique

Cited in

(20)

• Finding fair and efficient allocations when valuations don't add up
• Maximum Nash welfare and other stories about EFX
• A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
• Generalized binary utility functions and fair allocations
• scientific article; zbMATH DE number 1903384 (Why is no real title available?)
• Fairly allocating many goods with few queries
• Utility-based two-stage models with fairness concern
• scientific article; zbMATH DE number 6466174 (Why is no real title available?)
• Existence of EFX for two additive valuations
• Computing welfare-maximizing fair allocations of indivisible goods
• Fair division of indivisible goods: recent progress and open questions
• Approximately EFX allocations for indivisible chores
• Computing fair and efficient allocations with few utility values
• Two Algorithms for Additive and Fair Division of Mixed Manna
• A fair and truthful mechanism with limited subsidy
• The frontier of intractability for EFX with two agents
• The good, the bad and the submodular: fairly allocating mixed manna under order-neutral submodular preferences
• Dividing good and great items among agents with bivalued submodular valuations
• On the existence of EFX (and Pareto-optimal) allocations for binary chores
• On the existence of EFX (and Pareto-optimal) allocations for binary chores

This page was built for publication: Computing fair and efficient allocations with few utility values

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