201 citations · 1.5k across the 125 of their papers we have counts for
33 papers · 2 filters
Manipulability of Single Transferable Vote
Toby Walsh
For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manip…
Manipulating Tournaments in Cup and Round Robin Competitions
Tyrel Russell, Toby Walsh
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the…
Breaking Generator Symmetry
George Katsirelos, Nina Narodytska, Toby Walsh
Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where br…
The Weighted CFG Constraint
George Katsirelos, Nina Narodytska, Toby Walsh
We introduce the weighted CFG constraint and propose a propagation algorithm that enforces domain consistency in time. We show that this algorithm can be decomposed int…
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
Michael J. Maher, Nina Narodytska, Claude-Guy Quimper +1
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE…
Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental studies
Mirco Gelain, Maria Pini, Francesca Rossi +2
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications.…