Comments on: The Stable Marriage Problem and Sudoku
https://blog.tanyakhovanova.com/2021/09/the-stable-marriage-problem-and-sudoku/
Mathematics, applications of mathematics to life in general, and my life as a mathematician.Sun, 19 Sep 2021 21:30:18 +0000
hourly
1 https://wordpress.org/?v=5.8.1
By: Tanya Khovanova's Math Blog » Blog Archive » Joint-Groups Sudoku
https://blog.tanyakhovanova.com/2021/09/the-stable-marriage-problem-and-sudoku/#comment-13295
Sun, 19 Sep 2021 21:30:18 +0000https://blog.tanyakhovanova.com/?p=1513#comment-13295[…] « The Stable Marriage Problem and Sudoku […]
]]>
By: Use Sudoku for your successful marriage – The nth Root
https://blog.tanyakhovanova.com/2021/09/the-stable-marriage-problem-and-sudoku/#comment-13291
Tue, 07 Sep 2021 23:09:50 +0000https://blog.tanyakhovanova.com/?p=1513#comment-13291[…] Consider 3 men and 3 women who want to be married to each other in heterosexual couples. They rank each other without ties. The resulting 6 permutations of numbers 1, 2, and 3 that describe the six rankings are called the preference profile of this group of people. A matching is unstable if two people would be happier to run away together than to marry into the assigned couples. The two potential runaways are called a rogue couple. A matching is called stable if no rogue couple exists. The Gale-Shapley algorithm, invented by Gale and Shapley, finds a stable matching for any preference profile, implying that stable matching is always possible. … (Tanya Khovanova’s Math Blog) […]
]]>