Lec 31 MIT 18.085 Computational Science and Engineering I
chiefly in mind here uh two are coming from last time uh I wanted to say just a little more about this neat theorem of Max flow Min cut this was a this was a do an example of Duality and a particularly nice one and uh um chapter 7 of the book has uh examples and and more discussion of that then um you were kind enough to get involved in my new uh interest which was well the specific question was uh when can I complete a matrix given some of its entries when can I finish it out to have rank one and I have some news so of course I'm eager to tell you about it and uh and then the I I realized that it might be a pleasure to talk about Game Theory as another uh two person this is twers game theory created by uh V noyman and uh uh it's another example of Duality uh but uh just coming from somewhere from such a different source that it wasn't recognized uh for a little while that that it fit the framework okay with Max flow Min cut I just have this uh uh example to m...