Alex Slivkins’s research interests are in algorithms and theoretical computer science, spanning machine learning theory, social network analysis, and algorithmic economics. He has also worked on metric embeddings and algorithms for Internet and peer-to-peer networks. Across various domains, Alex is drawn to algorithmic problems with informational constraints. He is particularly interested in sequential decision-making and its applications to web search, mechanism design, and crowdsourcing markets. His work has received the best paper award at ACM EC 2010 and the best student paper award at ACM PODC 2005.
Projects / groups at MSR
- MSR-NY: Explore-exploit learning, Algorithmic Economics, Machine Learning.
- MSR-SVC: Multi-Armed Bandits, Social Algorithms, Computational Game Theory.
Education and employment
- Researcher, Microsoft Research New York, 2013 -
- Researcher, Microsoft Research Silicon Valley, 2007 - 2013.
- Visiting Scientist, Dept of Computer Science, Cornell University, Spring 2011.
- Postdoc at Brown University, 2006-2007, with Eli Upfal.
- Ph.D. Computer Science, Cornell University, 2000-2006.
Thesis committee: Jon Kleinberg (advisor), Gun Sirer and Eva Tardos.
Thesis: Embedding, Distance Estimation and Object Location in Networks.
- B.S. Mathematics (with distinction), California Inst. of Technology, 1996-2000.
- Bandits with Knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg and Aleksandrs Slivkins.
FOCS 2013: IEEE Symp. on Foundations of Computer Science.
- Low-distortion Inference of Latent Similarities from a Multiplex Social Network
Ittai Abraham, Shiri Chechik, David Kempe and Aleksandrs Slivkins.
SODA 2013: ACM-SIAM Symp. on Discrete Algorithms.
- Truthful Mechanisms with Implicit Payment Computation
Moshe Babaioff, Robert Kleinberg and Aleksandrs Slivkins.
EC 2010: ACM Symp. on Electronic Commerce (Best paper award).
- Multi-armed Bandits in Metric Spaces
Robert Kleinberg, Aleksandrs Slivkins and Eli Upfal.
STOC 2008: ACM Symp. on Theory of Computing.
- Meridian: A Lightweight Network Location Service without Virtual Coordinates
Bernard Wong, Aleksandrs Slivkins and Emin G. Sirer.
ACM SIGCOMM 2005.
- Metric Embeddings with Relaxed Guarantees
T-H.H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg and A. Slivkins.
SIAM J. on Computing, 38(6): 2303-2329, March 2009.
FOCS 2005: IEEE Symp. on Foundations of Computer Science.
- Triangulation and Embedding using Small Sets of Beacons
Jon Kleinberg, Aleksandrs Slivkins and Tom Wexler.
J. of the ACM, 56(6), Sept 2009.
FOCS 2004: IEEE Symp. on Foundations of Computer Science.
Mail: Microsoft Research New York, 641 6th Ave, 7th floor, New York, NY 10011.
Email: [lastname] at microsoft dot com
Phone: (650) 693-1195
Fax: (650) 693-3329, "Attn: slivkins at (650) 693-1195"