For the stable matching problem studied in class, consider the instance where you have 3 men called 1, 2, 3 and 3 women called a, b, c The preference list of each man is (a is more preferable than b than c). For each woman the preference list is <3,2,1>. Suppose when running the stable matching algorithm (with men proposing) the unmarried man chosen is the smallest number available - so for example if 1, 3 are unmarried - 1 would be chosen to propose next. What is the stable matching that we end up with? O (1.c). (2.b), (3.a) O (1.a). (2.b). (3.c) O (1.b), (2.a), (3.c) O (1.c). (2.a). (3.b)

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

Please written by computer source

 

For the stable matching problem studied in class, consider the instance where you have 3 men called 1, 2, 3
and 3 women called a, b, c
The preference list of each man is <a, b, c> (a is more preferable than b than c). For each woman the
preference list is <3,2,1>.
Suppose when running the stable matching algorithm (with men proposing) the unmarried man chosen is the
smallest number available - so for example if 1, 3 are unmarried - 1 would be chosen to propose next. What is
the stable matching that we end up with?
O (1.c). (2.b), (3.a)
O (1.a), (2.b). (3.c)
O (1.b), (2.a). (3.c)
O (1.c). (2.a). (3.b)
Transcribed Image Text:For the stable matching problem studied in class, consider the instance where you have 3 men called 1, 2, 3 and 3 women called a, b, c The preference list of each man is <a, b, c> (a is more preferable than b than c). For each woman the preference list is <3,2,1>. Suppose when running the stable matching algorithm (with men proposing) the unmarried man chosen is the smallest number available - so for example if 1, 3 are unmarried - 1 would be chosen to propose next. What is the stable matching that we end up with? O (1.c). (2.b), (3.a) O (1.a), (2.b). (3.c) O (1.b), (2.a). (3.c) O (1.c). (2.a). (3.b)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Temporal Difference Learning
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