Suppose that preferences in a stable matching instance are universal: all n jobs share the prefer- ences C₁ C₂ >> C₂ and all candidates share the preferences J₁ > J₂ > ... > Jn. (a) What pairing do we get from running the algorithm with jobs proposing? Can you prove this happens for all n? (b) What pairing do we get from running the algorithm with candidates proposing? (c) What does this tell us about the number of stable pairings?

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 please step by step

Suppose that preferences in a stable matching instance are universal: all n jobs share the prefer-
ences C₁ > C₂ > ... > Cn and all candidates share the preferences J₁ > J₂ > ... > Jn.
(a) What pairing do we get from running the algorithm with jobs proposing? Can you prove this
happens for all n?
(b) What pairing do we get from running the algorithm with candidates proposing?
(c) What does this tell us about the number of stable pairings?
Transcribed Image Text:Suppose that preferences in a stable matching instance are universal: all n jobs share the prefer- ences C₁ > C₂ > ... > Cn and all candidates share the preferences J₁ > J₂ > ... > Jn. (a) What pairing do we get from running the algorithm with jobs proposing? Can you prove this happens for all n? (b) What pairing do we get from running the algorithm with candidates proposing? (c) What does this tell us about the number of stable pairings?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 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