A classical mathematical problem is the “Stable Marriage” (see also this survey paper). The challenge is a to find a pairing of a group of men and women into couples such that the overall stability (happiness?) of the group based on individual preferences for partners is in some sense optimized. We will attempt to solve this problem with a self-organizing algorithm, and we are specifically interested in the question whether this enables the group to reorganize optimally when new partners become available (or existing ones become unavailable).