
This paper presents a polynomial-time algorithm for computing an allocation of indivisible goods that is both envy-free up to one good (EF1) and fractionally Pareto optimal (fPO) when the number of agents is fixed and agents have additive valuations.


coremsg

a-polynomial-time-algorithm-for-computing-an-ef1-and-fpo-allocation-for-a-fixed-number-of-agents-with-additive-valuations


A Polynomial-Time Algorithm for Computing an EF1 and fPO Allocation for a Fixed Number of Agents with Additive Valuations
