The Stable Matching Problem and Sudoku
Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan, Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima, Rastogi, and Michael Voigt
TL;DR
This paper explores the application of the Stable Marriage Problem to improve understanding of relationship stability, using Sudoku puzzles as a novel illustrative tool, blending mathematical theory with recreational puzzles.
Contribution
It introduces a new perspective on the Stable Marriage Problem by connecting it with Sudoku puzzles, offering a playful yet insightful approach to stability in matchings.
Findings
Demonstrates a novel link between stable matchings and Sudoku puzzles
Provides two new Sudoku puzzles inspired by the stable marriage concept
Offers insights into relationship stability through mathematical modeling
Abstract
Are you having trouble getting married? These days, there are lots of products on the market for dating, from apps to websites and matchmakers, but we know a simpler way! That's right -- your path to coupled life isn't through Tinder: it's through Sudoku! Read our fabulous paper where we explore the Stable Marriage Problem to help you find happiness and stability in marriage through math. As a bonus, you get two Sudoku puzzles with a new flavor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Game Theory and Voting Systems · Complexity and Algorithms in Graphs