High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming

@article{Bredereck2019HighMultiplicityFA,
  title={High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming},
  author={Robert Bredereck and A. Kaczmarczyk and D. Knop and R. Niedermeier},
  journal={Proceedings of the 2019 ACM Conference on Economics and Computation},
  year={2019}
}
We study the (parameterized) computational complexity of problems in the context of fair allocations of indivisible goods. More specifically, we show fixed-parameter tractability results for a broad set of problems concerned with envy-free, Pareto-efficient allocations of items (with agent-specific utility functions) to agents. In principle, this implies efficient exact algorithms for these in general computationally intractable problems whenever we face instances with few agents and low… Expand
6 Citations
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
  • PDF
Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types
  • PDF
Computing Fair Utilitarian Allocations of Indivisible Goods
  • PDF
Scheduling Kernels via Configuration LP
  • 2
  • PDF
FASTT: Team Formation Using Fair Division
  • 2
Fair Division: The Computer Scientist's Perspective
  • 2
  • PDF

References

SHOWING 1-4 OF 4 REFERENCES
On approximately fair allocations of indivisible goods
  • 318
  • Highly Influential
  • PDF
Almost Envy-Freeness with General Valuations
  • 85
  • Highly Influential
  • PDF
Finding Fair and Efficient Allocations
  • 79
  • Highly Influential
  • PDF
The Unreasonable Fairness of Maximum Nash Welfare
  • 53
  • Highly Influential
  • PDF