Simultaneous Envy and Equitability Guarantees

The paper investigates the compatibility of envy-freeness and equitability in fair division, focusing on both indivisible goods and chores. It shows that the relaxed notions EF1+EQ1 may not exist even for normalized additive valuations, but provides an algorithm that finds an EF1+EQ1 allocation for up to seven agents with binary goods. For chores, the authors prove that a stronger EFX+EQX guarantee always exists, regardless of normalization, and they also explore cross-notion ex‑ante and ex‑post fairness guarantees.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

• agents
• safety