Multiwinner voting captures a wide variety of settings, from parliamentary elections in
democratic systems to product placement in online shopping platforms. There is a large …

The problem of fairly allocating a set of indivisible items is a well-known challenge in the
field of (computational) social choice. In this scenario, there is a fundamental incompatibility …

We study a fair division model where indivisible items arrive sequentially, and must be
allocated immediately and irrevocably. Previous work on online fair division has shown …

Applications such as employees sharing office spaces over a workweek can be modeled as
problems where agents are matched to resources over multiple rounds. Agents' …

We study the problem of finding fair allocations--EF1 and EFX--of indivisible goods with
orientations. In an orientation, every agent gets items from their own predetermined set. For …

We initiate the study of fair distribution of delivery tasks among a set of agents wherein
delivery jobs are placed along the vertices of a graph. Our goal is to fairly distribute delivery …

Optimal allocation of agricultural water in the event of droughts is an important global
problem. In addressing this problem, many aspects, including the welfare of farmers, the …

A Latin square is an $ n\times n $ matrix filled with $ n $ distinct symbols, each of which
appears exactly once in each row and exactly once in each column. We introduce a problem …

Top-k personalized recommendations are ubiquitous, but do they make stable matches? We
study whether, given complete information, buyers and sellers would participate in matches …

Fair division [4, 9] is a key issue which raises many technical challenges while it tackles
concrete societal problems. House allocation [1, 7], where each agent receives exactly one …