2 papers
cs.GT2025
Almost and Approximate EFX for Few Types of Agents
Vishwa Prakash HV, Ruta Mehta, Prajakta Nimbhorkar
We study the problem of fair allocation of a set of indivisible goods among agents with distinct additive valuations, with the goal of achieving approximate envy-freeness u…
cs.GT2024
On the structure of EFX orientations on graphs
Jinghan A Zeng, Ruta Mehta
Fair division is the problem of allocating a set of items among agents in a fair manner. One of the most sought-after fairness notions is envy-freeness (EF), requiring that no agen…