12 citations · 20 across the 17 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.GT2025
Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna
Siddharth Barman, Paritosh Verma
The existence of allocations that are simultaneously fair and efficient is a central inquiry in fair division. Prominent results show that these complementary desiderata can be ach…
cs.GT2025
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…
cs.GT2025
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…