12 citations · 42 across the 19 of their papers we have counts for
6 papers · 2 filters
Fair and Efficient Allocations under Lexicographic Preferences
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish +1
Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods. But whether such allocations always exist or whethe…
Representative Proxy Voting
Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish +1
We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the cl…
Accomplice Manipulation of the Deferred Acceptance Algorithm
Hadi Hosseini, Fatima Umar, Rohit Vaish
The deferred acceptance algorithm is an elegant solution to the stable matching problem that guarantees optimality and truthfulness for one side of the market. Despite these desira…
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Umang Bhaskar, A. R. Sricharan, Rohit Vaish
We study the fair allocation of undesirable indivisible items, or chores. While the case of desirable indivisible items (or goods) is extensively studied, with many results known f…
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation
Rupert Freeman, Nisarg Shah, Rohit Vaish
We study the problem of allocating indivisible goods among agents with additive valuations. When randomization is allowed, it is possible to achieve compelling notions of fairness…
Equitable Allocations of Indivisible Chores
Rupert Freeman, Sujoy Sikdar, Rohit Vaish +1
We study fair allocation of indivisible chores (i.e., items with non-positive value) among agents with additive valuations. An allocation is deemed fair if it is (approximately) eq…