09-15 - Finding a perfect matching in a bipartitite graph...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 Graphs-Structure Games-Behavior Bring these together"Markets -Networks of particpants (buyers, sellers) -Interactions First:Matching-allocation of resources Then Add:buyers, sellers, prices Later:intermediaries VWX all want 2 rooms which is not good. VWX are the bottleneck that prevents me from assigning nodes. Given a set s of no d S is a constricted set if N(s) is strictly smaller than S. Constricted set--> no matching Easy way to match. iT IS CALLED the Matching Theorem-there is always a constricted set when there is no matching.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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).

Ask a homework question - tutors are online