The Complexity of Rationalizing Matchings Shankar Kalyanaraman∗ Computer Science Department California Institute of Technology Pasadena, CA 91125 - Shankar - Document - PDFSEARCH.IO

First Page	Meta Content
	The Complexity of Rationalizing Matchings Shankar Kalyanaraman∗ Computer Science Department California Institute of Technology Pasadena, CA 91125 Add to Reading List Document Date: 2008-03-10 14:13:07 Open Document File Size: 157,59 KB Share Result on Facebook

The Complexity of Rationalizing Matchings Shankar Kalyanaraman∗ Computer Science Department California Institute of Technology Pasadena, CA 91125 Add to Reading List