Lecture 7 CSE 331 Sep 16, 2009. Feedback forms VOLUNTARY Last 5 mins of the lecture.

Slides:



Advertisements
Similar presentations
Lecture 6 CSE 331 Sep 14. A run of the GS algorithm Mal Wash Simon Inara Zoe Kaylee.
Advertisements

CSE 421 Algorithms Richard Anderson Lecture 2. Announcements Office Hours –Richard Anderson, CSE 582 Monday, 10:00 – 11:00 Friday, 11:00 – 12:00 –Yiannis.
Lecture 4 CSE 331 Sep 9, Blog posts for lectures Starts from today See Sep 8 post on the blog.
Lecture 5 CSE 331 Sep 11, HW 1 out today Will be handed out at the END of the lecture Read the homework policy document carefully START EARLY! ©ehow.com.
Data Structures, Spring 2004 © L. Joskowicz 1 Data Structures – LECTURE 2 Elements of complexity analysis Performance and efficiency Motivation: analysis.
Lecture 24 CSE 331 Oct 30, Homework stuff Please turn in your HW 6 Graded HW 5 and HW 7 at the END of the lecture.
1 Efficiency of Algorithms. 2  Two main issues related to the efficiency of algorithms:  Speed of algorithm  Efficient memory allocation  We will.
Solution methods for Discrete Optimization Problems.
Lecture 8 CSE 331 Sep 18, Homeworks Hand in your HW 1 HW 2 and solutions to HW 1 out at the end of class Not naming your collaborators is same as.
CSE 421 Algorithms Richard Anderson Lecture 3. Classroom Presenter Project Understand how to use Pen Computing to support classroom instruction Writing.
Lecture 9 CSE 331 Sep 21, Gale-Shapley Algorithm Intially all men and women are free While there exists a free woman who can propose Let w be such.
Lecture 8 CSE 331 Sep 17, HW 1 due today Place Q1 and Q2 in separate piles I will not accept HWs after 1:15pm.
Lecture 6 CSE 331 Sep 10, Homeworks HW 1 posted online: see blog/piazza Pickup graded HW 0 in TA OHs.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 4.
2.1 Computational Tractability. 2 Computational Tractability Charles Babbage (1864) As soon as an Analytic Engine exists, it will necessarily guide the.
Lecture 4 CSE 331 Sep 6, TA change Swapnoneel will leave us for 531 Jiun-Jie Wang will join us.
Lecture 3 CSE 331. Stable Matching Problem Problem Statement Algorithm Problem Definition Implementation Analysis.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Lecture 2 CSE 331. Day 1 Survey On UBlearns Day 1 Survey (talking points) Security MS PhD for research Building PC’s for 442 It’s ok to play games –
Lecture 5 CSE 331 Sep 11, Submit the form I’ll need confirmation in writing. No graded material will be handed back till I get this signed form.
CSE 331: Review. Main Steps in Algorithm Design Problem Statement Algorithm Real world problem Problem Definition Precise mathematical def “Implementation”
CSCI 256 Data Structures and Algorithm Analysis Lecture 3 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
CSE 421 Algorithms Richard Anderson (for Anna Karlin) Winter 2006 Lecture 2.
Asymptotic Analysis CSE 331. Definition of Efficiency An algorithm is efficient if, when implemented, it runs quickly on real instances Implemented where?
CSCI 256 Data Structures and Algorithm Analysis Lecture 2 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
CSE 331: Review August 1, Main Steps in Algorithm Design Problem Statement Algorithm Real world problem Problem Definition Precise mathematical.
Lecture 4 CSE 331 Sep 7, 2016.
Lecture 8 CSE 331 Sep 14, 2011.
Lecture 5 CSE 331 Sep 8, 2017.
Lecture 6 CSE 331 Sep 9, 2013.
CSE 421: Introduction to Algorithms
Lecture 5 CSE 331 Sep 10, 2010.
Lecture 7 CSE 331 Sep 15, 2010.
Lecture 4 CSE 331 Sep 6, 2017.
Lecture 7 CSE 331 Sep 14, 2016.
Lecture 6 CSE 331 Sep 11, 2017.
Lecture 6 CSE 331 Sep 13, 2010.
Lecture 9 CSE 331 Sep 20, 2010.
Objective of This Course
S. Raskhodnikova; based on slides by K. Wayne
Lecture 8 CSE 331 Sep 12, 2014.
Lecture 9 CSE 331 Sep 18, 2017.
Lecture 7 CSE 331 Sep 13, 2017.
Lecture 9 CSE 331 Sep 19, 2012.
Lecture 5 CSE 331 Sep 6, 2013.
Lecture 5 CSE 331 Sep 7, 2012.
Lecture 8 CSE 331 Sep 16, 2016.
Lecture 7 CSE 331 Sep 13, 2011.
Lecture 9 CSE 331 Sep 19, 2016.
Lecture 10 CSE 331 Sep 21, 2011.
Lecture 12 CSE 331 Sep 27, 2010.
Richard Anderson Autumn 2016 Lecture 2
Lecture 8 CSE 331 Sep 15, 2017.
Lecture 10 CSE 331 Sep 21, 2012.
Lecture 36 CSE 331 Nov 30, 2012.
Lecture 6 CSE 331 Sep 12, 2011.
Lecture 8 CSE 331 Sep 15, 2011.
Lecture 9 CSE 331 Sep 15, 2014.
Lecture 9 CSE 331 Sep 20, 2010.
Lecture 5 CSE 331 Sep 5, 2014.
Lecture 6 CSE 331 Sep 12, 2016.
Lecture 7 CSE 331 Sep 10, 2014.
Lecture 5 CSE 331 Sep 9, 2011.
Lecture 9 CSE 331 Sep 19, 2011.
Lecture 7 CSE 331 Sep 11, 2013.
Lecture 5 CSE 331 Sep 9, 2016.
Richard Anderson Winter 2019 Lecture 2
Richard Anderson Autumn 2015 Lecture 2
Lecture 11 CSE 331 Sep 20, 2013.
Richard Anderson Autumn 2019 Lecture 2
Presentation transcript:

Lecture 7 CSE 331 Sep 16, 2009

Feedback forms VOLUNTARY Last 5 mins of the lecture

GS algo outputs a stable matching Last lecture, GS outputs a perfect matching m m w w m’w’ Assume there is an instability (m,w’) m prefers w’ to w w prefers m to m’ w’ last proposed to m’

Contradiction by Case Analysis Depending on whether w’ had proposed to m or not Case 1: w’ never proposed to m w’ m w’ prefers m’ to m Assumed w’ prefers m to m’ Source: 4simpsons.wordpress.com

Case 2: w’ had proposed to m Case 2.1: m had accepted w’ proposal m is now engaged to w Thus, m prefers w to w’ 4simpsons.wordpress.com m w’ Case 2.1: m had rejected w’ proposal m was engaged to w’’ (prefers w’’ to w’) m is finally engaged to w (prefers w to w’’) m prefers w to w’ 4simpsons.wordpress.com

Overall structure of case analysis Did w’ propose to m? Did m accept w’ proposal? 4simpsons.wordpress.com

Questions?

Extensions Fairness of the GS algorithm Different executions of the GS algorithm

Main Steps in Algorithm Design Problem Statement Algorithm Problem Definition “Implementation” Analysis n! Correctness Analysis

Definition of Efficiency An algorithm is efficient if, when implemented, it runs quickly on real instances Implemented where? Platform independent definition What are real instances? Worst-case Inputs Efficient in terms of what? Input size N N = 2n 2 for SMP

Definition-II n! Analytically better than brute force How much better? By a factor of 2?

Definition-III Should scale with input size If N increases by a constant factor, so should the measure Polynomial running time At most c. N d steps (c>0, d>0 absolute constants) Step: “primitive computational step”

More on polynomial time Problem centric tractability Can talk about problems that are not efficient! Read Sec 1.2 and 2.1 in [KT]

Asymptotic Analysis ( Travelling Salesman Problem

Which one is better?

Now?

And now?

The actual run times n! 100n 2 n2n2 Asymptotic View