A new government-run dating service for Singapore public servants ages 21-35 applies the Gale-Shapley stable marriage algorithm to match users. Each participant creates a ranked preference list from profile attributes and dealbreakers; designated proposers sequentially offer to their top choices while receivers hold their best offer and reject others, and rejected proposers move down their lists until no mutually preferable swaps remain. The user experience enforces one match per cycle, a 72-hour decision window, mutual-only contact release, and Singpass verification to ensure identity. The product intentionally avoids infinite scrolling and continuous swiping, framing success as getting users off the platform rather than maximizing engagement.
The algorithm guarantees mathematically stable pairings - no two people both prefer each other over their assigned matches - and produces proposer-optimal outcomes, meaning proposers receive their best possible stable match while receivers end up with their worst stable option. That same matching framework underpins medical residency placements and kidney-exchange programs, so this is a direct import of institutional matching into dating. By combining mandatory verification and low-velocity interaction design with a provable matching mechanism, the program tests whether a state-run, stability-focused approach can outperform commercial apps that prioritize user retention and endless choice.
Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.