Question 3 Answer the following questions: 1. Give an example of rankings for three applicants 1, 2, 3 and three jobs A, B, C. For which the Gale-Shapley algorithm (as presented in class) stops after three steps. 2. Consider the following rankings of applicants 1,2,3 and jobs A, B,C. Write all possible stable matchings for these rankings. You do not need to prove that they are stable. 1st 2nd 3rd 1 А В С Аpplicants 2 ВА С |1st 2nd 3rd A 2 1 3 B1 2 3 C| 1 2 3 Jobs 3 АВС 3. Using the rankings from the previous part, identify which stable matching is the output of the Gale-Shapley algorithm as presented in class.

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
Question 3 Answer the following questions:
1. Give an example of rankings for three applicants 1,2,3 and three jobs
A, B, C. For which the Gale-Shapley algorithm (as presented in class)
stops after three steps.
2. Consider the following rankings
Write all possible stable matchings for these rankings. You do not need to
prove that they are stable.
аpplicants 1,2, 3 аnd jobs А, В, С.
1st 2nd 3rd
1А В С
Аpplicants 2 ВА С
|1st 2nd 3rd
A 2 1 3
Jobs
B1 2 3
3
А В С
C|1 2 3
3. Using the rankings from the previous part, identify which stable matching
is the output of the Gale-Shapley algorithm as presented in class.
Transcribed Image Text:Question 3 Answer the following questions: 1. Give an example of rankings for three applicants 1,2,3 and three jobs A, B, C. For which the Gale-Shapley algorithm (as presented in class) stops after three steps. 2. Consider the following rankings Write all possible stable matchings for these rankings. You do not need to prove that they are stable. аpplicants 1,2, 3 аnd jobs А, В, С. 1st 2nd 3rd 1А В С Аpplicants 2 ВА С |1st 2nd 3rd A 2 1 3 Jobs B1 2 3 3 А В С C|1 2 3 3. Using the rankings from the previous part, identify which stable matching is the output of the Gale-Shapley algorithm as presented in class.
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Data Modeling Concepts
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.
Similar questions
  • SEE MORE QUESTIONS
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