This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Finding a perfect matching in a bipartitite graph is a special case of (can be translated into) Finding an opt assignment. Two BIG QUESTIONS 1. yOU want to find optimal assignment, How do you find an optimal assignment (as a central administratator) 2. How do we decentralize this process (via prices)?...
View Full Document
This note was uploaded on 12/03/2010 for the course CS 1112 taught by Professor Daisyfan during the Spring '08 term at Cornell University (Engineering School).
- Spring '08