Management Science and Engineering,
Institute for Computational and Mathematical Engineering,
and by courtesy Electrical Engineering,
A short bio.
Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi, ,Sequential Importance Sampling for Estimating Expectations over the Space of Perfect Matchings, submitted 2021.
Mohammad Roghani, Amin Saberi, David Wajc, Beating the Folklore Algorithm for Dynamic Matching, submitted 2021.
Yeganeh Alimohammadi, Christian Borgs, Amin Saberi, Locality of Random Digraphs on Expanders, submitted 2021.
Amin Saberi, David Wajc, The Greedy Algorithm is not optimal for On-Line Edge Coloring, International Colloquium on Automata, Languages and Programming (ICALP 2021).Mobin Y. Jeloudar, Irene Lo, Tristan Pollner, Amin Saberi, Decentralized Matching in Probabilistic Environments, ACM conference on Economics and Computation (EC 2021).
Christos Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc, Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities, ACM conference on Economics and Computation (EC 2021).
I. Ashlagi, M. Braverman, A. Saberi, C. Thomas, and G. Zhao, Tiered Random Matching Markets: Rank Is Proportional to Popularity, Innovations in Theoretical Computer Science (ITCS 2021).
N. Anari, N. Hu, A. Saberi, and A. Schild, Sampling Arborescences in Parallel, Innovations in Theoretical Computer Science (ITCS 2021).
Y. Feng, R. Niazadeh, A. Saberi, Two-stage Matching and Pricing with Applications to Ride Hailing, ACM-SIAM Symposium on Discrete Algorithms (SODA 2021).
M. Pavone, A. Saberi, M. Schiffer, M. Tsao, Online Hypergraph Matching with Delays, Conference on Web and Internet Economics (WINE 2020).
I. Ashlagi, J. Leshno, P. Qian, A. Saberi Queue Lengths as Constantly Adapting Prices: Allocative Efficiency Under Random Dynamics, ACM Conference on Economics and Computation (EC 2020).
I. Ashlagi, A. Saberi, A. Shameli, Assignment Mechanisms under Distributional Constraints, Operations Research (2020). Conference version in ACM-SIAM Symposium on Discrete Algorithms (SODA 2019).
M. Akbarpour, S. Malladi, and A. Saberi, Diffusion, Seeding, and the Value of Network Information, Revise and Resubmit, American Economic Review (AER). Conference version in the ACM conference on Economics and Computation (EC 2018).
Y. Feng, R. Niazadeh, A. Saberi, Linear Programming Based Online Policies for Real-Time Assortment of Reusable Resources, preprint (2019).
A. Ahmadi, H. Nazerzadeh, A. Saberi, N. Skochdopole and K. Sweeney, Competition in Ride-Hailing Markets, Conference on Web and Internet Economics (WINE 2019).
N. Anari, R. Niazadeh, A. Saberi, A. Shameli, Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection, ACM conference on Economics and Computation (EC 2019).
I. Ashlagi, M. Burq, C. Dutta, P. Jaillet, A. Saberi, and C. Sholley, Maximum Weight Online Matching with Deadlines, ACM conference on Economics and Computation (EC 2019).
A. Ahmadi, A. Jambulapati, A. Saberi, A. Sidford, Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications, ACM-SIAM Symposium on Discrete Algorithms (SODA 2019).
R. Niazadeh, A. Saberi and A. Shameli, Prophet Inequalities vs. Approximating Optimum Online, Conference on Web and Internet Economics (WINE 2018).
N. Anari, S. Gharan, A. Saberi, and N. Srivastava, Approximating the Largest Root and Applications to Interlacing Families, ACM-SIAM Symposium on Discrete Algorithms (SODA 2018).
M. Bayati, A. Montanari, and A. Saberi, Generating Random Graphs without Short Cycles, Operations Research (2018).
M. Akbarpour, A. Saberi and A. Shameli, Information aggregation in overlapping generations and the emergence of highly informed individuals, WINE 2017 (best paper award).
N. Anari, S. Gharan, L. Gurvits, and A. Saberi, Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices, FOCS 2017.
A. Shameli, T. Althoff, A. Saberi, and J. Leskovec, How Gamification Affects Physical Activity: Large-scale Analysis of Walking Challenges in a Mobile Application, WWW 2017.
A. Asadpour, M. Goemans, A. Madry, S. Oveis Gharan, A. Saberi, An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem, Operations Research 65:4, 1043-1061 (2017). (The conference version received the best paper award in SODA 2010.)
N. Anari, S. Gharan, A. Saberi, and M. Singh, Nash Social Welfare, Matrix Permanent, and Stable Polynomials, ITCS 2017 (accepted with distinction).
L. Fleischer, R. Garg, S. Kapoor, R., and A. Saberi, A Simple and Efficient Algorithm for Computing Market Equilibria, ACM Transactions on Algorithms 12(3): 34:1-34:15 (2016).
A. Kim, V. Liaghat, J. Qin, and A. Saberi, Online Energy Storage Management: an Algorithmic Approach, APPROX-RANDOM 2016.
G. Amanatidis, E. Markakis, A. Nikzad, and A. Saberi, Approximation Algorithms for Computing Maximin Share Allocations, ICALP 2015.
N. Berger, C. Borgs, J. T. Chayes, and A. Saberi, Asymptotic Behavior and Distributional Limits of Preferential Attachment Graphs, Annals of Probability, Volume 42, Number 1 (2014).
H. Nazerzadeh, A. Saberi, and R. Vohra, Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising, Operations Research 61(1): 98-111 (2013).
V. Manshadi, S. Oveis Gharan, and A. Saberi, Online Stochastic Matching: Online Actions Based on Offline Statistics, Mathematics of Operations Research 37(4): 559-573 (2012).
S. Oveis Gharan, A. Saberi, M. Singh, A Randomized Rounding Approach to the Traveling Salesman Problem, FOCS 2011 (best paper award).
A. Montanari, A. Saberi, The Spread of Innovations in Social Networks, in Proceedings of the National Academy of Sciences. See also the supplementary information, the conference version which appeared in FOCS 2009, and a short excerpt in ACM SIGecom exchanges.
V. Manshadi, S. Oveis Gharan, A. Saberi, Online Stochastic Matching: Online Actions Based on Offline Statistics, SODA 2011.
A. Mehta, A. Saberi, U. Vazirani, V. Vazirani, Adwords and Generalized On-line Matching , Journal of the ACM (2007). Conference version appeared in IEEE Symposium on Foundations of Computer Science (2005). A SIAM News article by Sara Robinson on this work.
| Huang Engineering Center, Office 309 |
475 Via Ortega
Stanford, CA 94305-4121
Office: (650) 724-2052
Cell: (650) 704-7857
|Assistant: Jenny Lam |
Phone: (650) 723-4173
Fax: (650) 723-1614