4. Matchings (a) For this question, use the bipartite graph in Figure 4. a b W X d y e Ꮓ f Figure 4: Bipartite graph i. Clearly indicate on the graph the matching M = {(b,v), (c,z), (e, w),(f,y)}. ii. Overlay on the appropriate network clearly indicating the source, the sink and the edge capacities. iii. Use Ford-Fulkerson to find a larger matching M'. iv. Run Ford-Fulkerson one more time, then as in lectures, use the run to find a vertex cover of size 5 (Question 4 continued on next page) (Question 4 continued) (b) Suppose the companies Anthropic, Google, Meta and Microsoft are looking to hire the development teams of the Large Language Models (LLM's) ChatGPT, Claude, Gemini and Llama. The companies have the following preference list (from highest to lowest) Anthropic Google Meta Microsoft Claude Gemini ChatGPT Llama Claude Gemini ChatGPT Llama Claude ChatGPT Llama ChatGPT Gemini Llama Gemini Claude and the teams (of developers of the large language models) have the following preference list (again highest to lowest) ChatGPT Microsoft Anthropic Meta Google Claude Anthropic Google Meta Gemini Google Anthropic Meta Llama Meta Microsoft Google Microsoft Microsoft Anthropic i. With the companies proposing to the teams of developers, find a stable matching.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

I need the following questions done in 5 minutes with handwritten working out 

4. Matchings
(a) For this question, use the bipartite graph in Figure 4.
a
b
W
X
d
y
e
Ꮓ
f
Figure 4: Bipartite graph
i. Clearly indicate on the graph the matching M = {(b,v), (c,z), (e, w),(f,y)}.
ii. Overlay on the appropriate network clearly indicating the source, the sink and the edge
capacities.
iii. Use Ford-Fulkerson to find a larger matching M'.
iv. Run Ford-Fulkerson one more time, then as in lectures, use the run to find a vertex
cover of size 5
(Question 4 continued on next page)
Transcribed Image Text:4. Matchings (a) For this question, use the bipartite graph in Figure 4. a b W X d y e Ꮓ f Figure 4: Bipartite graph i. Clearly indicate on the graph the matching M = {(b,v), (c,z), (e, w),(f,y)}. ii. Overlay on the appropriate network clearly indicating the source, the sink and the edge capacities. iii. Use Ford-Fulkerson to find a larger matching M'. iv. Run Ford-Fulkerson one more time, then as in lectures, use the run to find a vertex cover of size 5 (Question 4 continued on next page)
(Question 4 continued)
(b) Suppose the companies Anthropic, Google, Meta and Microsoft are looking to hire the
development teams of the Large Language Models (LLM's) ChatGPT, Claude, Gemini
and Llama.
The companies have the following preference list (from highest to lowest)
Anthropic
Google
Meta
Microsoft
Claude Gemini ChatGPT Llama
Claude Gemini ChatGPT Llama
Claude
ChatGPT
Llama ChatGPT Gemini
Llama Gemini Claude
and the teams (of developers of the large language models) have the following preference
list (again highest to lowest)
ChatGPT Microsoft Anthropic Meta Google
Claude Anthropic Google Meta
Gemini Google Anthropic Meta
Llama Meta Microsoft Google
Microsoft
Microsoft
Anthropic
i. With the companies proposing to the teams of developers, find a stable matching.
Transcribed Image Text:(Question 4 continued) (b) Suppose the companies Anthropic, Google, Meta and Microsoft are looking to hire the development teams of the Large Language Models (LLM's) ChatGPT, Claude, Gemini and Llama. The companies have the following preference list (from highest to lowest) Anthropic Google Meta Microsoft Claude Gemini ChatGPT Llama Claude Gemini ChatGPT Llama Claude ChatGPT Llama ChatGPT Gemini Llama Gemini Claude and the teams (of developers of the large language models) have the following preference list (again highest to lowest) ChatGPT Microsoft Anthropic Meta Google Claude Anthropic Google Meta Gemini Google Anthropic Meta Llama Meta Microsoft Google Microsoft Microsoft Anthropic i. With the companies proposing to the teams of developers, find a stable matching.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,