14 citations · 28 across the 17 of their papers we have counts for
8 papers · 1 filter
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments
Pascal Sauer, Ágnes Cseh, Pascal Lenzner
The International Chess Federation (FIDE) imposes a voluminous and complex set of player pairing criteria in Swiss-system chess tournaments and endorses computer programs that are…
Popular matchings with weighted voters
Klaus Heeger, Ágnes Cseh
In the Popular Matching problem, we are given a bipartite graph and for each vertex , strict preferences over the neighbors of . Given two matc…
Polynomially tractable cases in the popular roommates problem
Erika Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi +1
The input of the popular roommates problem consists of a graph and for each vertex , strict preferences over the neighbors of . Matching is more popular…
Pareto optimal and popular house allocation with lower and upper quotas
Ágnes Cseh, Tobias Friedrich, Jannik Peters
In the house allocation problem with lower and upper quotas, we are given a set of applicants and a set of projects. Each applicant has a strictly ordered preference list over the…
Three-Dimensional Popular Matching with Cyclic Preferences
Ágnes Cseh, Jannik Peters
Two actively researched problem settings in matchings under preferences are popular matchings and the three-dimensional stable matching problem with cyclic preferences. In this pap…
Multi-Robot Task Allocation -- Complexity and Approximation
Haris Aziz, Hau Chan, Ágnes Cseh +3
Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and are…