(a) In the notes, we show that the stable matching algorithm terminates in at most n² days. Prove the following stronger result: the stable matching algorithm will always terminate in at most (n − 1)² + 1 = n² −2n+2 days. (b) Provide a set of preference lists for 4 jobs and 4 candidates that will result in the upper bound from part (a) when running the Propose-and-Reject algorithm. Verify this by running the Propose-and-Reject algorithm on your preference lists.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Help me please

step by step

(a) In the notes, we show that the stable matching algorithm terminates in at most
n² days. Prove
the following stronger result: the stable matching algorithm will always terminate in at most
(n-1)²+1=n²-2n+2 days.
(b) Provide a set of preference lists for 4 jobs and 4 candidates that will result in the upper bound
from part (a) when running the Propose-and-Reject algorithm. Verify this by running the
Propose-and-Reject algorithm on your preference lists.
Transcribed Image Text:(a) In the notes, we show that the stable matching algorithm terminates in at most n² days. Prove the following stronger result: the stable matching algorithm will always terminate in at most (n-1)²+1=n²-2n+2 days. (b) Provide a set of preference lists for 4 jobs and 4 candidates that will result in the upper bound from part (a) when running the Propose-and-Reject algorithm. Verify this by running the Propose-and-Reject algorithm on your preference lists.
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Introduction to Greedy algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education