The Gale-Shapley algorithm is upper bounded by ≤ n^2 for n men and n women, since each man can only make ≤n proposals. However, we haven’t shown a lower bound on number of iterations. To show the lower bound is also in the order of n^2, please give a way to construct the preference lists for n men and n women such that the Gale-Shapley algorithm will run for Θ(n^2) iterations. (For simplicity, you can assume that the algorithm always chooses the unmatched man with the smallest index at each iteration).
The Gale-Shapley
However, we haven’t shown a lower bound on number of iterations. To show the lower bound is also in
the order of n^2, please give a way to construct the preference lists for n men and n women such that the
Gale-Shapley algorithm will run for Θ(n^2) iterations. (For simplicity, you can assume that the algorithm
always chooses the unmatched man with the smallest index at each iteration).
![](/static/compass_v2/shared-icons/check-mark.png)
Introduction
An algorithm is a set of instructions or steps used to complete a task or solve a problem. It is a set of logical rules that are created to complete a given task. Algorithms are used in computing to give directions to machines and help them complete tasks in an efficient manner. Algorithms are used across a variety of fields including artificial intelligence, data mining, and natural language processing. Algorithms are also used in problem-solving activities, such as solving a maze or playing a game.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)