Social and Information Sciences Laboratory (SISL) Seminar
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,
"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.
For more information, please contact Tiffany Kim by phone at x3773 or by email at [email protected].