14 citations · 28 across the 17 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2021★ 4 cited
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…
cs.DS2021★ 1 cited
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…
cs.DS2014
Improved Algorithmic Results for Unsplittable Stable Allocation Problems
Ágnes Cseh, Brian C. Dean
The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes)…