2012 - Fellow of Alfred P. Sloan Foundation
Nicole Immorlica focuses on Mathematical optimization, Combinatorics, Approximation algorithm, Computer security and Common value auction. Her research integrates issues of Optimal mechanism and Distribution in her study of Mathematical optimization. Her work on Partition as part of her general Combinatorics study is frequently connected to K-independent hashing, thereby bridging the divide between different branches of science.
She has researched Computer security in several fields, including Resilience, Click fraud, Virtual network and Click-through rate. Her research in Common value auction tackles topics such as Operations research which are related to areas like Secretary problem. The study incorporates disciplines such as English auction, Keyword advertising, Advertising and Unique bid auction in addition to Forward auction.
Nicole Immorlica mainly focuses on Mathematical optimization, Microeconomics, Mathematical economics, Common value auction and Combinatorics. Her Mathematical optimization study frequently links to related topics such as Scheduling. Her work in the fields of Incentive and Externality overlaps with other areas such as Social status and Welfare.
Her work on Nash equilibrium, Best response, Repeated game and Outcome as part of general Mathematical economics study is frequently linked to Value, bridging the gap between disciplines. Her Common value auction study combines topics in areas such as Core, Advertising, Heuristics and Mechanism design. Her research in the fields of Partition overlaps with other disciplines such as Monotone polygon.
Nicole Immorlica mostly deals with Mathematical optimization, Value, Inequality, Matching and Homophily. Her research investigates the connection between Mathematical optimization and topics such as Feature that intersect with issues in Quality Score. Nicole Immorlica has included themes like Stability, Risk analysis and Online algorithm in her Matching study.
Her work deals with themes such as Discrete mathematics and Leverage, which intersect with Online algorithm. Her Homophily study integrates concerns from other disciplines, such as Disadvantage, Economic mobility, Inefficiency and Demographic economics. Her Online advertising study deals with Common value auction intersecting with Outcome.
Nicole Immorlica mainly investigates Mathematical optimization, Mechanism, Value, Inequality and Decision problem. Her Mathematical optimization research focuses on Projection and how it relates to Quality Score and Incentive. Her Mechanism research overlaps with Risk analysis, Price discovery, Information acquisition, Stability and Matching.
Her Value study spans across into subjects like Mechanism design, Optimal mechanism, Bundle, Simple and A priori and a posteriori. Her Inequality research incorporates themes from Discrete mathematics and Leverage. In most of her Decision problem studies, her work intersects topics such as Online algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar;Nicole Immorlica;Piotr Indyk;Vahab S. Mirrokni.
symposium on computational geometry (2004)
Correlation clustering in general weighted graphs
Erik D. Demaine;Dotan Emanuel;Amos Fiat;Nicole Immorlica.
workshop on approximation and online algorithms (2006)
Marriage, honesty, and stability
Nicole Immorlica;Mohammad Mahdian.
symposium on discrete algorithms (2005)
Matroids, secretary problems, and online mechanisms
Moshe Babaioff;Nicole Immorlica;Robert Kleinberg.
symposium on discrete algorithms (2007)
Semantic similarity between search engine queries using temporal correlation
Steve Chien;Nicole Immorlica.
the web conference (2005)
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Mohammad Taghi Hajiaghayi;Nicole Immorlica;Vahab S. Mirrokni.
acm/ieee international conference on mobile computing and networking (2003)
Multi-unit auctions with budget-constrained bidders
Christian Borgs;Jennifer Chayes;Nicole Immorlica;Mohammad Mahdian.
electronic commerce (2005)
Dynamics of bid optimization in online advertisement auctions
Christian Borgs;Jennifer Chayes;Nicole Immorlica;Kamal Jain.
the web conference (2007)
A first look at peer-to-peer worms: threats and defenses
Lidong Zhou;Lintao Zhang;Frank McSherry;Nicole Immorlica.
international workshop on peer to peer systems (2005)
A Knapsack Secretary Problem with Applications
Moshe Babaioff;Nicole Immorlica;David Kempe;Robert Kleinberg.
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques (2007)
Google (United States)
Google (United States)
Microsoft (United States)
Microsoft (United States)
Microsoft (United States)
Cornell University
Microsoft (United States)
Weizmann Institute of Science
Northwestern University
Harvard University
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: