When aggregating the preferences of multiple agents into one collective choice, it is easily
seen that certain cases call for randomization or other means of tiebreaking. For example, if …

1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

School districts in the United States and around the world are increasingly moving away
from traditional neighborhood school assignment, in which pupils attend closest schools to …

We study the House Allocation problem (also known as the Assignment problem), ie, the
problem of allocating a set of objects among a set of agents, where each agent has ordinal …

Cake cutting is one of the most fundamental settings in fair division and mechanism design
without money. In this paper, we consider different levels of three fundamental goals in cake …

We allocate objects to agents as exemplified primarily by school choice. Welfare judgments
of the object-allocating agency are encoded as edge weights in the acceptability graph. The …

Fix a Pareto-optimal, strategy-proof, and nonbossy deterministic matching mechanism and
define a random matching mechanism by assigning agents to the roles in the mechanism …

Computational social choice is a research area at the intersection of computer science,
mathematics, and economics that is concerned with aggregation of preferences of multiple …

A simple mechanism for allocating indivisible resources is sequential allocation in which
agents take turns to pick items. We focus on possible and necessary allocation problems …

Matching theory studies how agents and/or objects from different sets can be matched with
each other while taking agents' preferences into account. The theory originated in 1962 with …