2 citations · 7 across the 14 of their papers we have counts for
3 papers · 1 filter
Fair Rank Aggregation
Diptarka Chakraborty, Syamantak Das, Arindam Khan +1
Ranking algorithms find extensive usage in diverse areas such as web search, employment, college admission, voting, etc. The related rank aggregation problem deals with combining m…
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
Siddharth Barman, Arindam Khan, Sudarshan Shyam +1
We study fair division of goods under the broad class of generalized assignment constraints. In this constraint framework, the sizes and values of the goods are agent-specific, and…
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
Arindam Khan, Aditya Lonkar, Saladi Rahul +2
Set cover and hitting set are fundamental problems in combinatorial optimization which are well-studied in the offline, online, and dynamic settings. We study the geometric version…