most citedManipulation and gender neutrality in stable marriage procedures

10 citations · 29 across the 6 of their papers we have counts for

collaborators
Showing cs.AIShow all

7 papers · 1 filter

cs.AI20099 cited

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…

cs.AI2009

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…

cs.AI2009

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…

cs.AI2009

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.…

cs.AI200910 cited

Manipulation and gender neutrality in stable marriage procedures

Maria Pini, Francesca Rossi, Brent Venable +1

The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a…

cs.AI20099 cited

Symmetries of Symmetry Breaking Constraints

George Katsirelos, Toby Walsh

Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different sy…