The increasingly diversified Quality-of-Service (QoS) requirements envisioned for future
wireless networks call for more flexible and inclusive multiple access techniques in 6G for …

Hedonic diversity games are a variant of the classical hedonic games designed to better
model a variety of questions concerning diversity and fairness. Previous works mainly …

We propose a novel model for refugee housing respecting the preferences of accepting
community and refugees themselves. In particular, we are given a topology representing the …

Abstract The Stable Roommates problem involves matching a set of agents into pairs based
on the agents' strict ordinal preference lists. The matching must be stable, meaning that no …

Social distance games have been extensively studied as a coalition formation model where
the utilities of agents in each coalition were captured using a utility function $ u $ that took …

Given a set of agents with approval preferences over each other, we study the task of finding
k matchings fairly representing everyone's preferences. To formalize fairness, we apply the …

In this thesis, we derive models and algorithms for a large variety of collective choice
problems, while placing our focus on scalability. That is, even though parts of the …

We study two roommate assignment problems, called Ordinal Roommate Allocation and
Cardinal Roommate Allocation, where students have preferences over roommates, rooms …

We study relationships between different relaxed notions of core stability in hedonic games,
which are a class of coalition formation games. Our unified approach applies to a newly …

Atomic congestion games are a classic topic in network design, routing, and algorithmic
game theory, and are capable of modeling congestion and flow optimization tasks in various …