Research

I am interested in problems at the intersection of game theory and algorithms.

Papers in Preparation

  1. B. Rastegari, A. Condon, N. Immorlica, and K. Leyton-Brown. Two-Sided Matching with Partial Information, in preparation.
  2. R. DePrisco, N. Lynch, A. Shvartsman, N. Immorlica, and T. Ne Win. A Formal Treatment of Lamport's Paxos Algorithm, (permanently) in preparation.

Publications

  1. C. Brandt, N. Immorlica, G. Kamath and R.D. Kleinberg. An Analysis of One-Dimensional Schelling Segregation, STOC 2012.
  2. S. Chawla, N. Immorlica, and B. Lucier. On the Limits of Black-Box Reductions in Mechanism Design, STOC 2012.
  3. N. Immorlica and E. Pountourakis. On Budget-Balanced Group-Strategyproof Cost-Sharing Mechanisms, WINE 2012.
  4. N. Immorlica, R. Kranton, and G. Stoddard. Striving for Social Status, EC 2012.
  5. N. Immorlica, M. Mahdian, and G. Stoddard. Optimal User Search, Ad Auction Workshop 2012.
  6. N. Immorlica and B. Lucier. On the Impossibility of Black-Box Truthfulness without Priors , Workshop on Bayesian Mechanism Design (WBMD), 2011.
  7. J. Hatfield, N. Immorlica, and S.D. Kominers. Testing Substitutability, to appear in Games and Economic Behavior, 2011.
  8. N. Immorlica, A. Tauman Kalai, B. Lucier, A. Moitra, A. Postlewaite, and M. Tennenholtz. Dueling Algorithms, STOC 2011.
  9. N. Haghpanah, N. Immorlica, V. Mirrokni, K. Munagala. Optimal Auctions with Positive Network Externalities, to appear in ACM Transactions on Economics and Computation. Conference version appeared in EC 2011.
  10. N. Immorlica, E. Markakis, G. Piliouras Coalition Formation and Price of Anarchy in Cournot Oligopolies, WINE 2010.
  11. V. Conitzer, N. Immorlica, J. Letchford, K. Munagala, and L. Wagman. False-name-proofness in Social Networks, WINE 2010.
  12. N. Anari, S. Ehsani, M. Ghodsi, N. Haghpanah, N. Immorlica, H. Mahini, and V. Mirrokni. Equilibrium Pricing with Positive Externalities, WINE 2010. Journal version to appear in Theoretical Computer Science.
  13. N. Immorlica, B. Lucier, and B. Rogers. Emergence of Cooperation in Anonymous Social Networks through Social Capital, EC 2010.
  14. M.H. Bateni, M.T. Hajiaghayi, N. Immorlica, and H. Mahini. Network Bargaining with Capacity Constraints, ICALP 2010.
  15. R. Gomes, N. Immorlica, and V. Markakis. Externalities in Keyword Auctions: an Empirical and Theoretical Assessment, Workshop on Internet and Network Economics (WINE), 2009.
  16. U. Feige, N. Immorlica, V. Mirrokni, and H. Nazerzadeh. PASS Approximation: A Framework for Analyzing and Designing Heuristics, 2009. Conference version appeared in APPROX, 2009.
  17. N. Chen, N. Immorlica, A. Karlin, M. Mahdian, and A. Rudra. Approximating Matches Made in Heaven, ICALP 2009.
  18. M. Babaioff, M. Dinitz, A. Gupta, N. Immorlica, and K. Talwar. Secretary Problems: Weights and Discounts, SODA 2009.
  19. C. Borgs, J. Chayes, N. Immorlica, A. Kalai, V. Mirrokni, and C. Papadimitriou. The Myth of the Folk Theorem, Games and Economic Behavior, 2009. Conference version appeared in STOC 2008.
  20. U. Feige, N. Immorlica, V. Mirrokni, and H. Nazerzadeh. A Combinatorial Allocation Mechanism for Banner Advertisement with Penalties, WWW 2008.
  21. N. Immorlica, A. Karlin, M. Mahdian, and K. Talwar. Balloon popping with applications to ascending auctions, FOCS 2007.
  22. M. Babaioff, N. Immorlica, D. Kempe, and R. Kleinberg.A Knapsack Secretary Problem with Applications, APPROX 2007.
  23. N. Immorlica, J. Kleinberg, M. Mahdian, and T. Wexler. The role of compatibility in the diffusion of technologies in social networks, EC 2007.
  24. C. Borgs, J. Chayes, O. Etesami, N. Immorlica, K. Jain, and M. Mahdian. Dynamics of bid optimization in online advertisement auctions, WWW 2007.
  25. M. Babaioff, N. Immorlica, and R. Kleinberg. Matroids, Secretary Problems, and Online Mechanisms, SODA 2007.
  26. N. Immorlica, K. Jain, and M. Mahdian. Game-Theoretic Aspects of Designing Hyperlink Structures, Workshop on Internet and Network Economics (WINE), 2006.
  27. N. Immorlica, R. Kleinberg, and M. Mahdian. Secretary Problems with Competing Employers, Workshop on Internet and Network Economics (WINE), 2006.
  28. B. Dean, M. Goemans, and N. Immorlica. Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data, European Symposium on Algorithms (ESA), 2006.
  29. B. Dean, M. Goemans, and N. Immorlica. The Unsplittable Stable Marriage Problem, IFIP International Conference on Theoretical Computer Science (IFIP TCS), 2006.
  30. N. Immorlica, L. Li, V. Mirrokni, and A. Schulz. Coordination Mechanisms for Selfish Scheduling, Workshop on Internet and Network Economics (WINE), 2005. Full version: Theoretical Computer Science WINE 2005 special issue, volume 410, number 17, April 2009, pages 1589-1598.
  31. N. Immorlica, K. Jain, M. Mahdian, and K. Talwar. Click Fraud Resistant Methods for Learning Click-Through Rates, Workshop on Internet and Network Economics (WINE), 2005.
  32. G. Aggarwal, A. Fiat, A. Goldberg, J. Hartline, N. Immorlica, and M. Sudan. Derandomization of Auctions, Games and Economic Behavior, 2010. Conference version appeared in STOC 2005.
  33. N. Immorlica, D. Karger, E. Nikolova, and R. Sami. First-Price Procurement Auctions, 2010. Conference version: First-Price Path Auctions appeared in EC, 2005.
  34. C. Borgs, J. Chayes, N. Immorlica, M. Mahdian, and A. Saberi. Multi-Unit Auctions with Budget-Constrained Bidders, EC 2005.
  35. N. Immorlica and M. Mahdian. Marriage, Honesty, and Stability. Conference version appeared in SODA 2005.
  36. N. Immorlica, M. Mahdian, and V. Mirrokni. Limitations of cross-monotonic cost-sharing schemes, ACM Transactions on Algorithms special issue, volume 4, number 2, April 2008. Conference version appeared in SODA 2005 and was winner of the best student paper award.
  37. N. Immorlica and S. Chien. Semantic Similarity between Search Engine Queries Using Temporal Correlation, WWW 2005.
  38. R. Bhatia, N. Immorlica, T. Kimbrel, V.S. Mirrokni, S. Naor, B. Schieber. Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees, Theory of Computing Systems, volume 41, number 1, January 2008, pages 2-26.  Conference version appeared in SPAA 2005.
  39. N. Immorlica, M. Mahdian, and V. Mirrokni. Cycle cover with short cycles, STACS 2005.
  40. N. Immorlica, D. Karger, M. Minkoff, and V. Mirrokni. On the Costs and Benefits of Procrastination: Approximation Algorithms for Stochastic Combinatorial Optimization Problems, SODA 2004.
  41. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-Sensitive Hashing Scheme Based on p-Stable Distributions, SoCG 2004.
  42. E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica. Correlation Clustering in General Weighted Graphs, Theoretical Computer Science special issue, volume 361, number 2-3, September 2006, pages 172-187.  Conference version (E.D. Demaine and N. Immorlica, Correlation Clustering with Partial Information) appeared in APPROX 2003.
  43. Y. Bejarano, N. Immorlica, S. Noar, and M. Smith. Location Area Design in Cellular Networks, MOBICOM 2003. Full version: Efficient Location Area Planning for Personal Communication Systems, IEEE/ACM Transactions on Networking, volume 14, number 2, April 2006, pages 438-450.
  44. M. Hajiaghayi, N. Immorlica, and V. Mirrokni. Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks, IEEE/ACM Transactions on Networking, volume 15, issue 6, December 2007, pages 1345-1358.  Conference version appeared in MOBICOM 2003.

Surveys, Book Chapters

  1. N. Immorlica. Why I don't rob banks for a living, ACM XRDS Crossroads, March 2011.
  2. M. Babaioff, N. Immorlica, D. Kempe, and R.D. Kleinberg. Online Auctions and Generalized Secretary Problems, SIGecom Exchanges 7(2), June 2008.
  3. N. Immorlica and A. Wirth. "Clustering with Qualitative Information", in Constrained Clustering: Advances in Algorithms, Theory, and Applications, S. Basu, I. Davidson, and K. Wagstaff (eds.), Chapman & Hall/CRC Press, 2008, pages 313-328.
  4. A. Andoni, M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. "Locality-sensitive hasing using stable distributions", in Nearest Neighbor Methods in Learning and Vision: Theory and Practice, T. Darrell, P. Indyk, and G. Shakhnarovich (eds.), MIT Press, 2006.

Thesis

  1. Ph.D. Thesis, Computing With Strategic Agents
  2. Masters Thesis, Data Acquisition System Design for the Alpha Magnetic Spectrometer

Online Talks

  1. Microsoft Research Talk:The Degree of Segregation in Social Networks, Microsoft Research New England, April 2012.
  2. Innovations in Algorithmic Game Theory: Dueling Algorithms, Hebrew University, May 2011.
  3. Meet the EECS-Faculty Talk: Marriage, Honesty, and Stability, Northwestern University, April 2009.