12 citations · 12 across the 3 of their papers we have counts for
4 papers
Truthful and Fair Mechanisms for Matroid-Rank Valuations
Siddharth Barman, Paritosh Verma
We study the problem of allocating indivisible goods among strategic agents. We focus on settings wherein monetary transfers are not available and each agent's private valuation is…
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations
Siddharth Barman, Paritosh Verma
We study the problem of allocating indivisible goods among agents in a fair and economically efficient manner. In this context, the Nash social welfare-defined as the geometric mea…
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations
Siddharth Barman, Paritosh Verma
We study fair and economically efficient allocation of indivisible goods among agents whose valuations are rank functions of matroids. Such valuations constitute a well-studied cla…
Space Lower Bounds for Graph Stream Problems
Paritosh Verma
This work concerns with proving space lower bounds for graph problems in the streaming model. It is known that computing the length of shortest path between two nodes in the stream…