Dynamic Placement in Refugee Resettlement
In this paper, we design an online algorithm for refugee allocation.
Ariel D. Procaccia
Advertisement
Author Archives
Technical Perspective: An Answer to Fair Division’s Most Enigmatic Question
The envy-free cake-cutting problem stood its ground for two decades, until it was cracked by Aziz and Mackenzie. Their solution is presented in "A Bounded and Envy-Free Cake Cutting Algorithm."
Which Is the Fairest (Rent Division) of Them All?
What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation of solutions in polynomial time that optimize a criterion of social justice, subject to the envy freeness constraint.
Cake Cutting: Not Just Child's Play
How to fairly allocate divisible resources, and why computer scientists should take notice.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved