12 citations · 45 across the 20 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.GT2021
Semi-Popular Matchings and Copeland Winners
Telikepalli Kavitha, Rohit Vaish
Given a graph where every vertex has a weak ranking over its neighbors, we consider the problem of computing an optimal matching as per agent preferences. Classical not…
cs.GT2021★ 1 cited
Equitable Division of a Path
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan +1
We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to…