activity
20162026
most citedEquitable Allocations of Indivisible Chores

12 citations · 50 across the 18 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.GT2019★ 3 cited

Fair Division through Information Withholding

Hadi Hosseini, Sujoy Sikdar, Rohit Vaish +2

Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods that addresses pairwise envy by the removal of at most one good. In the worst case, each…

cs.AI2019★ 2 cited

Multi-type Resource Allocation with Partial Preferences

Haibin Wang, Sujoy Sikdar, Xiaoxi Guo +3

We propose multi-type probabilistic serial (MPS) and multi-type random priority (MRP) as extensions of the well known PS and RP mechanisms to the multi-type resource allocation pro…

cs.HC2019★ 2 cited

Minimizing Time-to-Rank: A Learning and Recommendation Approach

Haoming Li, Sujoy Sikdar, Rohit Vaish +3

Consider the following problem faced by an online voting platform: A user is provided with a list of alternatives, and is asked to rank them in order of preference using only drag-…

cs.GT2019★ 5 cited

Equitable Allocations of Indivisible Goods

Rupert Freeman, Sujoy Sikdar, Rohit Vaish +1

In fair division, equitability dictates that each participant receives the same level of utility. In this work, we study equitable allocations of indivisible goods among agents wit…

cs.AI2019

Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking

Jun Wang, Sujoy Sikdar, Tyler Shepherd +3

STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. Howev…