research
∙
07/07/2023
Computational complexity of k-stable matchings
We study deviations by a group of agents in the three main types of matc...
share
research
∙
02/21/2023
The Swiss Gambit
In each round of a Swiss-system tournament, players of similar score are...
research
∙
09/15/2022
Envy-freeness in 3D Hedonic Games
We study the problem of partitioning a set of agents into coalitions bas...
research
∙
05/04/2022
Maximum-utility popular matchings with bounded instability
In a graph where vertices have preferences over their neighbors, a match...
research
∙
12/20/2021
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments
The International Chess Federation (FIDE) imposes a voluminous and compl...
research
∙
10/12/2021
Popular matchings with weighted voters
In the Popular Matching problem, we are given a bipartite graph G = (A ∪...
research
∙
07/14/2021
Polynomially tractable cases in the popular roommates problem
The input of the popular roommates problem consists of a graph G = (V, E...
research
∙
07/08/2021
Pareto optimal and popular house allocation with lower and upper quotas
In the house allocation problem with lower and upper quotas, we are give...
research
∙
05/19/2021
Three-Dimensional Popular Matching with Cyclic Preferences
Two actively researched problem settings in matchings under preferences ...
research
∙
03/23/2021
Multi-Robot Task Allocation – Complexity and Approximation
Multi-robot task allocation is one of the most fundamental classes of pr...
research
∙
03/03/2021
Optimal Kidney Exchange with Immunosuppressants
Algorithms for exchange of kidneys is one of the key successful applicat...
research
∙
02/02/2021
On absolutely and simply popular rankings
Van Zuylen et al. introduced the notion of a popular ranking in a voting...
research
∙
06/03/2020
A quest for a fair schedule: The Young Physicists' Tournament
The Young Physicists Tournament is an established team-oriented scientif...
research
∙
07/24/2019
The stable marriage problem with ties and restricted edges
In the stable marriage problem, a set of men and a set of women are give...
research
∙
01/20/2019
Pareto optimal coalitions of fixed size
We tackle the problem of partitioning players into groups of fixed size,...
research
∙
11/16/2018
Understanding popular matchings via stable matchings
Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
research
∙
11/16/2018
Popularity, stability, and the dominant matching polytope
Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
research
∙
09/30/2018
Pairwise preferences in the stable marriage problem
We study the classical, two-sided stable marriage problem under pairwise...
research
∙
07/03/2018
Popular Matchings in Complete Graphs
Our input is a complete graph G = (V,E) on n vertices where each vertex ...
research
∙
09/10/2017
