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

Cites Work

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

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)