We study deviations by a group of agents in the three main types of matc...
In each round of a Swiss-system tournament, players of similar score are...
We study the problem of partitioning a set of agents into coalitions bas...
In a graph where vertices have preferences over their neighbors, a match...
The International Chess Federation (FIDE) imposes a voluminous and compl...
In the Popular Matching problem, we are given a bipartite graph G = (A ∪...
The input of the popular roommates problem consists of a graph G = (V, E...
In the house allocation problem with lower and upper quotas, we are give...
Two actively researched problem settings in matchings under preferences ...
Multi-robot task allocation is one of the most fundamental classes of
pr...
Algorithms for exchange of kidneys is one of the key successful applicat...
Van Zuylen et al. introduced the notion of a popular ranking in a voting...
The Young Physicists Tournament is an established team-oriented scientif...
In the stable marriage problem, a set of men and a set of women are give...
We tackle the problem of partitioning players into groups of fixed size,...
Let G = (A ∪ B, E) be an instance of the stable marriage problem with
st...
Let G = (A ∪ B, E) be an instance of the stable marriage problem with
st...
We study the classical, two-sided stable marriage problem under pairwise...
Our input is a complete graph G = (V,E) on n vertices where each vertex
...
An unceasing problem of our prevailing society is the fair division of g...