HIGHLIGHTS
- who: Ágnes Cseh from the (UNIVERSITY) have published the paper: A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences, in the Journal: (JOURNAL)
- what: The authors show for all five models how to capture two different stability notions namely weak and strong stability. The authors explore two levels of commitment in the models : one where the authors have an individual variable for each agent (individual commitment) and another one where the determination of a variable involves pairing the three agents at once (group commitment). The experiments show that . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.