
Matchings and Copeland's Method
Given a graph G = (V,E) where every vertex has weak preferences over its...
read it

Equitable Division of a Path
We study fair resource allocation under a connectedness constraint where...
read it

Fair and Efficient Allocations under Lexicographic Preferences
Envyfreeness up to any good (EFX) provides a strong and intuitive guara...
read it

On Approximate EnvyFreeness for Indivisible Chores and Mixed Resources
We study the fair allocation of undesirable indivisible items, or chores...
read it

Representative Proxy Voting
We study a model of proxy voting where the candidates, voters, and proxi...
read it

Accomplice Manipulation of the Deferred Acceptance Algorithm
The deferred acceptance algorithm is an elegant solution to the stable m...
read it

Best of Both Worlds: ExAnte and ExPost Fairness in Resource Allocation
We study the problem of allocating indivisible goods among agents with a...
read it

Equitable Allocations of Indivisible Chores
We study fair allocation of indivisible chores (i.e., items with nonpos...
read it

Fair Division through Information Withholding
Envyfreeness up to one good (EF1) is a wellstudied fairness notion for...
read it

Minimizing TimetoRank: A Learning and Recommendation Approach
Consider the following problem faced by an online voting platform: A use...
read it

Equitable Allocations of Indivisible Goods
In fair division, equitability dictates that each participant receives t...
read it

Stable fractional matchings
We study a generalization of the classical stable matching problem that ...
read it

Greedy Algorithms for Maximizing Nash Social Welfare
We study the problem of fairly allocating a set of indivisible goods amo...
read it
Rohit Vaish
is this you? claim profile