8 papers · 1 filter
Existence and Computation of Fair Allocations under Constraints
Siddharth Barman, Ioannis Caragiannis, Sudarshan Shyam
We study fair division of divisible goods under generalized assignment constraints. Here, each good has an agent-specific value and size, and every agent has a budget constraint th…
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…
Fair and Efficient Allocation of Indivisible Mixed Manna
Siddharth Barman, Vishwa Prakash HV, Aditi Sethia +1
We study fair division of indivisible mixed manna (items whose values may be positive, negative, or zero) among agents with additive valuations. Here, we establish that fairness --…
Exact Maximin Share Fairness via Adjusted Supply
Siddharth Barman, Satyanand Rammohan, Aditi Sethia
This work addresses fair allocation of indivisible items in settings wherein it is feasible to create copies of resources or dispose of tasks. We establish that exact maximin share…
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…
Fair Division with Market Values
Siddharth Barman, Soroush Ebadian, Mohamad Latifian +1
We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally…