activity
20212024
most citedFair Allocation of Two Types of Chores

9 citations · 12 across the 5 of their papers we have counts for

collaborators

5 papers

cs.GT2024

Maximin Fair Allocation of Indivisible Items under Cost Utilities

Sirin Botan, Angus Ritossa, Mashbat Suzuki +1

We study the problem of fairly allocating indivisible goods among a set of agents. Our focus is on the existence of allocations that give each agent their maximin fair share--the v…

cs.GT2024

Committee Monotonicity and Proportional Representation for Ranked Preferences

Haris Aziz, Patrick Lederer, Dominik Peters +2

We study committee voting rules under ranked preferences, which map the voters' preference relations to a subset of the alternatives of predefined size. In this setting, the compat…

cs.GT2023★ 1 cited

Envy-free House Allocation under Uncertain Preferences

Haris Aziz, Isaiah Iliffe, Bo Li +3

We study the envy-free house allocation problem when agents have uncertain preferences over items and consider several well-studied preference uncertainty models. The central probl…

cs.GT2022★ 9 cited

Fair Allocation of Two Types of Chores

Haris Aziz, Jeremy Lindsay, Angus Ritossa +1

We consider the problem of fair allocation of indivisible chores under additive valuations. We assume that the chores are divided into two types and under this scenario, we present…

cs.DS2021★ 2 cited

Algorithms and Hardness for Multidimensional Range Updates and Queries

Joshua Lau, Angus Ritossa

Traditional orthogonal range problems allow queries over a static set of points, each with some value. Dynamic variants allow points to be added or removed, one at a time. To suppo…