In this paper we consider stable matchings that are subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main contribution is an algorithm that determines when...

In this note, we’d like to talk about a recent paper (Karapetyan, Parkes, Gutin, Gagarin, Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints, J. AI Research, 66 (2019) 85–122) which, in our view, made an important contribution to the experimental...