S. Matthew Weinberg
Ph.D. Candidate
CSAIL, EECS, MIT
Contact:
32-G604
Stata Center
32 Vassar Street
Cambridge, MA 02139
Email:
smweinberg (at) csail (dot) mit (dot) edu
CV: My CV
I am a third year Ph.D. candidate in the Theory of Computation Group, Computer Science and Artificial Intelligence Lab at MIT, where my advisor is Costis Daskalakis. I am interested in algorithms and algorithmic game theory, and mechanism design in particular.
I obtained my B.A. in Math from Cornell University in 2010.
Publications:
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other GeneralizationsYang Cai, Constantinos Daskalakis, S. Matthew Weinberg
To appear in the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013).
Optimal and Efficient Parametric Auctions
Pablo Azar, Constantinos Daskalakis, Silvio Micali, S. Matthew Weinberg
To appear in the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013).
Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization
Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg
In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012).
MIT News Article
On Optimal Multi-Dimensional Mechanism Design
Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg
Newsletter of the ACM Special Interest Group on E-commerce, 10(2), 2011. Newsletter.
Symmetries and Optimal Multi-Dimensional Mechanism Design
Constantinos Daskalakis, S. Matthew Weinberg
In Proceedings of the 13th ACM Conference on Electronic Commerce (EC 2012). Best Student Paper Award.
Matroid Prophet Inequalities
Robert Kleinberg, S. Matthew Weinberg
In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012).
An Algorithmic Characterization of Multi-Dimensional Mechanisms
Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg
In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012).
Pricing Randomized Allocations
Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg
In Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA 2010).