This blog post explores an implementation of the Gale-Shapley algorithm in Rust. The author shares their experience with modeling proposals and acceptances between two entities, Proposers and Acceptors, using reference counting and mutable states. The post invites feedback on the chosen implementation strategy.