Home Publications Teaching
 

Ali Makhdoumi

PhD Candidate, MIT, EECS
Email: makhdoum (at) mit (dot) edu

Address: 32-D640, 77 Mass. Ave.
Cambridge, MA, 02139


I am a PhD candidate in the Laboratory for Information and Decision Systems (LIDS) at Massachusetts Institute of Technology. I am advised by Professor Asuman Ozdaglar and Professor Daron Acemoglu. My main research interests are game theory, networks, optimization and learning theory with applications to revenue and operations management.

Before coming to MIT, I received my B.S. in Electrical Engineering and Pure Mathematical Science (double major) from Sharif University of Technology in 2011. I earned a M.S. in Electrical Engineering and Computer Science from MIT in 2013 under superviosion of Prof. Muriel Médard and Prof. Yury Polyanskiy.

Publications

Working Papers:

Learning from Reviews

With Daron Acemoglu, Azarakhsh Malekian, Asuman Ozdaglar, 2017

Strategic Dynamic Pricing with Network Externalities

With Azarakhsh Malekian, Asuman Ozdaglar, 2017.
Presented in Production and Operations Management Society (POMS) Annual Conference, Seattle, Washington, May 2017.

Journal Papers:

Informational Braess' Paradox: The Effect of Information on Traffic Congestion

With Daron Acemoglu, Azarakhsh Malekian, Asuman Ozdaglar
Minor Revision, Operations Research , 2017
Presented in INFORMS Annual Meeting, Nashville, Tennessee, Nov. 2016 and Allerton Conference on Communication, Control, and Computing, Champaign, Illinois, Sep. 2016.

Privacy-Constrained Network Formation

With Daron Acemoglu, Azarakhsh Malekian, Asuman Ozdaglar
Games and Economics Behavior , 2017.
Presented in INFORMS Annual Meeting, Philadelphia, Pennsylvania, Nov. 2015 and Workshop on the Economics of Networks, Systems and Computation (NetEcon), Portland, Oregon, June 2015.

Convergence Rate of Distributed ADMM over Networks

With Asuman Ozdaglar
IEEE Transactions on Automatic Control , 2017.
Presented in INFORMS Annual Meeting, Philadelphia, Pennsylvania, Nov. 2015 and Modeling and Optimization: Theory and Applications Conference (MOPTA), Bethlehem, Pennsylvania, July 2015.

Principal Inertia Components and Applications

With Flavio Calmon, Muriel Médard, Mayank Varia, Mark Christiansen, Ken Duffy
IEEE Transactions on Information Theory , 2017.

Network Maximal Correlation

With Soheil Feizi, Ken Duffy, Manolis Kellis, Muriel Médard.
IEEE Transactions on Network Sceience and Engineering , 2017.

Refereed Conference Papers:

  1. A. Makhdoumi, A. Ozdaglar, Graph Balancing for Distributed Subradient Methods over Directed Graphs, Conference on Decision and Control (CDC), 2015.
  2. A. Makhdoumi, A. Ozdaglar, Broadcast-based Distributed Alternating Direction Method of Multipliers, Allerton Conference on Communication, Control, and Computing, 2014.
  3. A. Makhdoumi, F. Calmon, M. Médard, Forgot Your Password: Correlation Dilution, International Symposium on Information Theory (ISIT), 2015.
  4. F. Calmon, A. Makhdoumi, M. Médard, Fundamental Limits of Perfect Privacy, International Symposium on Information Theory (ISIT), 2015.
  5. A. Makhdoumi, S. Salamatian, N. Fawaz, M. Médard, From Information Bottleneck to Privacy Funnel, Information Theory Workshop (ITW), 2014.
  6. A. Makhdoumi, N. Fawaz, Utility-Privacy Trade-off under Statistical Uncertainty, Allerton Conference on Communication, Control, and Computing, 2013.
  7. A. Makhdoumi, S. Huang, M. Médard, Y. Polyanskiy, On Locally Decodable source Coding, International Conference on Communication (ICC), 2015.
  8. A. Beirami, R. Calderbank, M. Christiansen, K. Duffy, A. Makhdoumi, M. Médard, A geometric perspective on guesswork, Allerton Conference on Communication, Control, and Computing, 2015.
  9. U. Speidel, T. A. Gulliver, A. Makhdoumi, M. Médard, Using T-codes as locally decodable source codes, Information Theory Workshop (ITW), 2014.
  10. S. Feizi, D. E. Lucani, C. W. Sørensen, A. Makhdoumi, M. Médard, Tunable Sparse Network Coding for Multicast Networks, NetCod, 2014.
  11. A. Makhdoumi, H. K. Abadi, P. Pad, H. Saeedi, F. Marvasti, A. Alishahi, Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices, International Symposium on Information Theory (ISIT), 2012.

Teaching and Work Experience