Scribd
Upload
10 views29 pages

Lect 4

Uploaded by

zyl178377
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
10 views29 pages

Lect 4

Uploaded by

zyl178377
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

Lecture 4

CSE 331
Sep 4, 2024
Please do keep on asking
Qs!

he only bad question is the one that is not asked!

ot just technical Qs but also on how the class is run


We’re not mind readers
If you need it, ask for help
Syllabus Quiz (and sections)
Separate Proof idea/proof
details
Office hours finalized

Come ask your proof


related Questions!
1 True/False poll
st
Register your project
groups
Deadline: Friday, Sep 20, 11:59pm

If you miss this deadline then you will get a


ZERO on the ENTIRE project
Piazza Response policy
Solutions to HW 0 out
Make broadband more
available
BOTH
technical
and societal
issues

Say you are


tasked to
come up with
the
infrastructure
Questions/Comments?
Make broadband more
Input requirements
available Is Internet a right?
Environmental factors
Where are the customers located?
Security/Privacy
What are the bandwidth requirements?
Where is funding coming
How is the input represented? from?
Income inequality in
What objective are we optimizing?
population
How should the connections be configured? Get regulatory approval
Hire people
Output requirements
Get access to physical space
Problem Definition
Outreach
Where should we lay down the physical stuff?

What algorithm should be use to do this?


Algorithm Design
Implement the scheme
How should we do testing and maintenance?
Main Steps in Algorithm
Design
Problem Statement Real world problem

Problem Definition Precise mathematical def

Algorithm

“Implementation” Data Structures

Analysis Correctness/Run time


Questions/Comments?
National Resident Matching
(Screen) Docs are coming
to BUF

Buffalo General
Bailey (Grey’s Anatomy)

Millard Filmore (Gates Circle)

JD (Scrubs)
Millard Filmore (Suburban)
What can go wrong?
The situation is unstable!
What happens in real life

Preferences

Information

Preferences
NRMP plays matchmaker
Stable Matching Problem

David Gale Lloyd Shapley*


Questions/Comments?
Incorrect Proof Details:
Argument does
not use Q1(b) on HW0
Follows
from
ANYTHING
part (a)
about the
Let P(n) be the number of perfect matchings with n men and n women
problem
statement!
This assumes number
Base case: P(1) = 1! = 1
of perfect matchings
only depends on n
Inductive hypothesis: Assume that P(n-1) = (n-1)!

Inductive step: Note that P(n) = n*P(n-1) = n*(n-1)! = n!

What are the issues with the above


“proof”?
Incorrect Proof Details:
Q1(b) on HW0 Needs justification

Claim 1: Number of perfect matchings is = number of permutations of


1…n

Claim 2: Number of permutations of 1…n is n!

Needs justification
Claims 1 + 2 prove the result

Follow from 191


(?)

What are the issues with the above


proof?
Proof by contradiction for
Q1(a)
Assume for contradiction there is an example where number of perfect
matchings depends on the identities of the men and women.
You can only assume
Let n =1 and consider two cases things about the
(1) M = {BP} and W = {JA} example directly
(2) M = {BBT} and W = {AJ} implied by it being a
counter-example
In both cases the number of perfect matchings is 1 = 1!

Hence contradiction. There is NO contradiction

What are the issues with the above


proof?
Questions/Comments?
Matching Employers &
Applicants
Input: Set of employers (E)
Set of applicants (A)
Preferences

Output: An assignment of applicants to employers that is “stable

For every x in A and y in E such that x is not assigned to y, either

(i) y prefers every accepted applicant to x; or

(ii) x prefers her employer to y

You might also like