7 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.GT2023★ 7 cited
Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations
Michal Feldman, Simon Mauras, Vishnu V. Narayan +1
We study best-of-both-worlds guarantees for the fair division of indivisible items among agents with subadditive valuations. Our main result establishes the existence of a random a…
cs.GT2023★ 1 cited
Fair Chore Division under Binary Supermodular Costs
Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with binary marginals. Such functions capture complemen…
cs.DS2017
A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3
Vishnu V. Narayan
We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our…