In the classic Secretary Problem, every "no" is final. But how realistic is that? In reality, we almost always have an opportunity to change our minds and return to a recent candidate. In this post, we will relax this strict rule and see how the selection strategy changes if we have the possibility to return to a few previous options.
Typically, during speed dating, boys move from table to table, while girls sit. Is this fair? Maybe. But let's consider a problem of organizing "equal rights" speed dating, in which each participant can interact with any other participant of the opposite gender and visit every table. This post explains how to organize such speed dating and how the CP-Sat solver can be useful in solving this problem.
Disclaimer: The problem is of theoretical interest, and its solution is not recommended for practical use.