Social and Information Sciences Laboratory (SISL) Seminar

Friday December 5, 2008 12:00 PM

Hardness of Approximation Results for Network Formation Games (Techniques from Theoretical Computer Science for Problems in Revealed Preference)

Speaker: Shankar Kalyanaraman, Caltech
Location: Baxter 237
"Hardness of Approximation Results for Network Formation Games (Techniques from Theoretical Computer Science for Problems in Revealed Preference)," Shankar Kalyanaraman, graduate student in engineering and applied science, Caltech.
Series Linde Institute/Social and Information Sciences Laboratory Seminar Series (SISL)

Contact: Tiffany Kim at x3773 tiffany@hss.caltech.edu