6 papers
Fair and Efficient Balanced Allocations for Additive Valuations
Benjamin Cookson, Nisarg Shah, Paritosh Verma
We study the existence of fair and efficient allocations of indivisible goods under the balancedness constraint, which requires that any two agents' bundles differ in size by at mo…
Fair Division Under Inaccurate Preferences
Trung Dang, Daniel Halpern, Anuran Makur +3
The fair allocation of scarce resources is a central problem in mathematics, computer science, operations research, and economics. While much of the fair-division literature assume…
On the Fairness of Normalized p-Means for Allocating Goods and Chores
Owen Eckart, Alexandros Psomas, Paritosh Verma
Allocating items in a fair and economically efficient manner is a central problem in fair division. We study this problem for agents with additive preferences, when items are all g…
Fair Division Beyond Monotone Valuations with Applications to Equitable Graph Partitioning
Siddharth Barman, Paritosh Verma
This paper studies fair division of divisible and indivisible items among agents whose cardinal preferences are not necessarily monotone. We establish the existence of fair divisio…
Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna
Siddharth Barman, Paritosh Verma
The existence of allocations that are fair and efficient, simultaneously, is a central inquiry in fair division literature. A prominent result in discrete fair division shows that…
Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
Daniel Halpern, Alexandros Psomas, Paritosh Verma +1
We consider the fundamental problem of allocating indivisible items that arrive over time to agents with additive preferences, with the goal of minimizing envy. This proble…