Fair and efficient allocation with few agent types, few item types, or small value levels

DOI10.1016/J.ARTINT.2022.103820MaRDI QIDQ2680786zbMATH OpenOpenAlexFDO

Authors Trung Thanh Nguyen, Jörg Rothe

Publication date 4 January 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2022.103820

zbMATH Keywords

max-min fairnessPareto efficiencyproportionalitybi-criteria optimizationmaximin sharefair division of indivisible goods

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 7525485 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• scientific article; zbMATH DE number 7651150 (Why is no real title available?)
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A unified framework for designing EPTAS for load balancing on parallel machines
• About the Structure of the Integer Cone and Its Application to Bin Packing
• Almost envy-freeness with general valuations
• An approximation algorithm for max-min fair allocation of indivisible goods
• Approximation schemes for scheduling on parallel machines
• Combinatorial algorithm for restricted max-min fair allocation
• Combining fairness with throughput: Online routing with multiple objectives
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
• Computing welfare-maximizing fair allocations of indivisible goods
• Distributed fair allocation of indivisible goods
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
• Fair Allocation of Indivisible Goods
• Fair enough: guaranteeing approximate maximin shares
• Fairness in routing and load balancing
• Fast integer programming in fixed dimension
• Faster Algorithms for Integer Programs with Block Structure
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
• Integer Programming with a Fixed Number of Variables
• MaxMin allocation via degree lower-bounded arborescences
• Mechanisms for multi-unit combinatorial auctions with a few distinct goods
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Minkowski's Convex Body Theorem and Integer Programming
• On allocating goods to maximize fairness
• On integer points in polyhedra
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• Optimal bounds on the price of fairness for indivisible goods
• Parameterized algorithms
• Polynomiality for bin packing with a constant number of item types
• The Knapsack Sharing Problem
• The Santa Claus problem
• The efficiency of fair division
• The polynomial-time hierarchy
• The price of fairness
• The price to pay for forgoing normalization in fair division of indivisible goods

Cited in

(1)

• No Agent Left Behind: Dynamic Fair Division of Multiple Resources

This page was built for publication: Fair and efficient allocation with few agent types, few item types, or small value levels

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