|
Morteza Zadimoghaddam |
|
Hi! My name is Morteza Zadimoghaddam. I am a PhD student in MIT, CSAIL. I work under supervision of Professor Erik D. Demaine. I finished my Bachelor degree in Sharif University of Technology, Computer Engineering Department, Tehran-Iran.
Research Interests * Approximation and Randomized Algorithms * Algorithmic Game Theory * Embeddings and Its Algorithmic Aspects * Algorithmic Graph Theory and Combinatorics * Computational Complexity and Inapproximability
Selected Publications 1. Constant Price of Anarchy in Network Creation Games via Public Service Advertising (joint work with Erik Demaine) appeared in WAW 2010, preprint. 2. Collusion in VCG Path Procurement Auctions (joint work with Yoram Bachrach and Peter Key) appeared in WINE 2010, preprint . 3. Trading off Mistakes and Don’t Know Predictions (joint work with Amin Sayedi and Avrim Blum) appeared in NIPS 2010, preprint. 4. The submodular secretary problem and its extensions (joint work with MohammadHossein Bateni and MohammadTaghi Hajiaghayi) appeared in APPROX 2010, preprint. 5. How Efficient Can Gossip Be? (On the Message Complexity of Resilient Information Exchange) (joint work with Dan Alistarh, Seth Gilbert and Rachid Guerraoui) appeared in ICALP 2010, preprint. 6. Collaborative Scoring with Dishonest Participants (joint work with Seth Gilbert, Rachid Guerraoui and Faezeh Malakouti) appeared in SPAA 2010, preprint. 7. Scheduling to Minimize Power Consumption using Submodular Functions (joint work with Erik Demaine) appeared in SPAA 2010, preprint. 8. Minimizing the Diameter of a Network Using Shortcut Edges (joint work with Erik Demaine) appeared in SWAT 2010, preprint. 9. Minimizing Movement (joint work with E. Demaine, M. Hajiaghayi, H. Mahini, S. Oveisgharan and A. Sayedi) in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, January 7-9, 2007, pages 258-267. Journal version to appear in Transactions on Algorithms, preprint. 10. Scheduling to Minimize Gaps and Power Consumption (joint work with E. Demaine, M. Ghodsi, M. Hajiaghayi and A. Sayedi) in Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), San Diego, California, June 9-11, 2007, pages 46-54, preprint. 11. The Price of Anarchy in Network Creation Games (joint work with E. Demaine, M. Hajiaghayi and H. Mahini) in Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PoDC 2007), Portland, Oregon, August 1215, 2007, pages 292-298, journal version to appear in Transactions on Algorithms, preprint. 12. Spanning Trees with Minimum Weighted Degrees (joint work with M. Ghodsi, H. Mahini, K. Mirjalali, S. Oveisgharan and A. Sayedi) Information Processing Letters, Vol. 104, issue 3, pp. 113-116, 31 Oct. 2007, preprint. 13. The Price of Anarchy in Cooperative Network Creation Games (joint work with E. Demaine, M. Hajiaghayi and H. Mahini) to appear in Issue 8.2 of SIGecom Exchanges, a preliminary version appeared in STACS 2009, preprint. 14. Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction (joint work with Mihai Badoiu, E. Demaine, M. Hajiaghayi and Anastasios Sidiropoulos) appeared in APPROX 2008, preprint. 15. Singleton Betting for Permutation Betting Markets, (joint work with Mohammad Ghodsi, Hamid Mahini and Vahab Mirrokni), to appear in Algorithmica, a preliminary version appeared in ACM Conference on Electronic Commerce 2008, preprint. 16. Some notes on fix-free codes, (joint work with A. Kakhbod, A. Nazari) appeared in the Proceedings of the 42nd Conference on Information Sciences and Systems (CISS 2008), preprint.
Working and Submitted Papers 1. Optimal-Time Adaptive Tight Renaming with Applications to Counting (joint work with Dan Alistarh, James Aspens, Keren Censor-Hillel, and Seth Gilbert) under submission. 2. A Constant Factor Approximation for Minimizing Maximum Movement (joint work with Erik Demaine) under submission. 3. Coalition Structures in Graph Games (joint work with Yoram Bachrach, Pushmeet Kohli, and Vladimir Kolmogorov) under submission. 4. Online Stochastic Matching (joint work with Bernhard Haeupler, and Vahab Mirrokni) under submission. 5. Compression with Graphical Constraints: An Interactive Browser (joint work with Amin Karbasi) under submission. 6. Learning disjunction functions with few mistakes and linear Don’t Know answers. under submission.
Honors and Awards 1. First rank in National Graduate Entrance Exam in Computer Science, Tehran, Iran, 2007 2. Awarded as Outstanding Student by university president, 2003 3. Gold Medal in Iranian National Olympiad in Informatics, 2002 4. Bronze Medal in Iranian National Olympiad in Informatics, 2001
Teaching and Work Experience 1. Member of the National Committee at YSC (an association for selecting and working with Iranian Olympiad Team members in Informatics Olympiad IOI), Nov 2005 - Oct 2007 2. Scientific Observer of Iranian Team in IOI, Summer 2004, Greece. 3. Member of the Scientific Committee at YSC, July 2003 - present 4. Teaching Assistant, Sharif University of Technology, Fall 2004 - Spring 2006 * Data Structure and Algorithms (Fall 2005, Fall 2006); |
