Nicole Immorlica
#73,689
Most Influential Person Now
Theoretical computer scientist
Nicole Immorlica's AcademicInfluence.com Rankings
Nicole Immorlicacomputer-science Degrees
Computer Science
#8109
World Rank
#8530
Historical Rank
Theoretical Computer Science
#134
World Rank
#134
Historical Rank
Database
#8168
World Rank
#8517
Historical Rank
Download Badge
Computer Science
Why Is Nicole Immorlica Influential?
(Suggest an Edit or Addition)According to Wikipedia, Nicole Immorlica is a theoretical computer scientist at Microsoft Research, known for her work on algorithmic game theory and locality-sensitive hashing. Education and career Immorlica completed her Ph.D. in 2005 at the Massachusetts Institute of Technology, under the joint supervision of David Karger and Erik Demaine. Her dissertation was Computing with Strategic Agents.
Nicole Immorlica's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Locality-sensitive hashing scheme based on p-stable distributions (2004) (2999)
- Correlation clustering in general weighted graphs (2006) (305)
- Marriage, honesty, and stability (2005) (254)
- Matroids, secretary problems, and online mechanisms (2007) (240)
- Dynamics of bid optimization in online advertisement auctions (2007) (239)
- Multi-unit auctions with budget-constrained bidders (2005) (226)
- A Knapsack Secretary Problem with Applications (2007) (206)
- A Simple and Approximately Optimal Mechanism for an Additive Buyer (2014) (205)
- Decoupled Classifiers for Group-Fair and Efficient Machine Learning (2017) (203)
- Semantic similarity between search engine queries using temporal correlation (2005) (192)
- Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks (2003) (176)
- Online auctions and generalized secretary problems (2008) (171)
- Coordination mechanisms for selfish scheduling (2005) (170)
- A First Look at Peer-to-Peer Worms: Threats and Defenses (2005) (159)
- On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems (2004) (146)
- Limitations of cross-monotonic cost sharing schemes (2005) (132)
- Correlation Clustering with Partial Information (2003) (130)
- Click Fraud Resistant Methods for Learning Click-Through Rates (2005) (126)
- The Disparate Effects of Strategic Manipulation (2018) (122)
- Approximating Matches Made in Heaven (2009) (114)
- The myth of the folk theorem (2008) (92)
- Secretary problems: weights and discounts (2009) (82)
- The role of compatibility in the diffusion of technologies through social networks (2007) (82)
- Externalities in Keyword Auctions: An Empirical and Theoretical Assessment (2009) (65)
- Adversarial Bandits with Knapsacks (2018) (64)
- Derandomization of auctions (2005) (64)
- Dueling algorithms (2011) (63)
- The price of anarchy in large games (2015) (59)
- An analysis of one-dimensional schelling segregation (2012) (59)
- Maximizing Influence in an Unknown Social Network (2018) (56)
- First-price path auctions (2005) (55)
- Two-sided matching with partial information (2013) (54)
- Uncharted but not Uninfluenced: Influence Maximization with an Uncertain Network (2017) (52)
- A Unifying Hierarchy of Valuations with Complements and Substitutes (2014) (51)
- Randomization Beats Second Price as a Prior-Independent Auction (2015) (50)
- Efficient location area planning for personal communication systems (2003) (48)
- Recharging Bandits (2018) (47)
- Optimal auctions with positive network externalities (2011) (46)
- The Cooperative Game Theory Foundations of Network Bargaining Games (2010) (44)
- Maximizing Welfare with Incentive-Aware Evaluation Mechanisms (2020) (43)
- Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals (2015) (43)
- Social Status and Badge Design (2013) (41)
- Decoupled classifiers for fair and efficient machine learning (2017) (40)
- A combinatorial allocation mechanism with penalties for banner advertising (2008) (40)
- Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks (2007) (38)
- Constrained Signaling in Auction Design (2013) (37)
- Secretary Problems with Competing Employers (2006) (34)
- Social Status in Networks (2017) (33)
- Optimal Data Acquisition for Statistical Estimation (2017) (31)
- Equilibrium pricing with positive externalities (2010) (31)
- Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks (2014) (29)
- On the limits of black-box reductions in mechanism design (2012) (28)
- False-Name-Proofness in Social Networks (2010) (28)
- Matroid Secretary Problems (2018) (27)
- Unleashing Linear Optimizers for Group-Fair Learning and Optimization (2018) (26)
- Incentives in Large Random Two-Sided Markets (2015) (26)
- Coalition Formation and Price of Anarchy in Cournot Oligopolies (2010) (26)
- Procrastination with Variable Present Bias (2016) (25)
- Repeated Sales with Multiple Strategic Buyers (2017) (25)
- Cycle Cover with Short Cycles (2005) (25)
- The Unsplittable Stable Marriage Problem (2006) (24)
- Socially Stable Matchings in the Hospitals/Residents Problem (2013) (24)
- Power Struggles in the Digital Economy: Platforms, Workers, and Markets (2018) (22)
- Incentivizing Exploration with Selective Data Disclosure (2018) (22)
- Information Acquisition in Matching Markets: The Role of Price Discovery (2020) (19)
- Efficient location area planning for personal communication systems (2006) (19)
- Reasoning about optimal stable matchings under partial information (2014) (18)
- Cooperation in anonymous dynamic social networks (2010) (17)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (2003) (17)
- Testing substitutability (2012) (17)
- The Importance of Communities for Learning to Influence (2017) (16)
- Designing and Evolving an Electronic Agricultural Marketplace in Uganda (2018) (15)
- Bayesian Exploration with Heterogeneous Agents (2019) (15)
- Non-quasi-linear Agents in Quasi-linear Mechanisms (2020) (14)
- On-Demand or Spot? Selling the Cloud to Risk-Averse Customers (2016) (14)
- Constrained signaling for welfare and revenue maximization (2013) (14)
- Fast Core Pricing for Rich Advertising Auctions (2016) (14)
- Optimal Auctions with Positive Network Externalities (2013) (14)
- PASS Approximation: A Framework for Analyzing and Designing Heuristics (2013) (14)
- Prophet Inequalities with Linear Correlations and Augmentations (2020) (13)
- Equilibrium Pricing with Positive Externalities (Extended Abstract) (2010) (12)
- Computing with strategic agents (2005) (11)
- Access to Population-Level Signaling as a Source of Inequality (2018) (10)
- PASS Approximation (2009) (10)
- Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data (2006) (9)
- A Simple and Approximately Optimal Mechanism for an Additive Buyer (2020) (9)
- Game-Theoretic Aspects of Designing Hyperlink Structures (2006) (9)
- Emergence of Cooperation in ANonymous Social Networks through Social Capital (2010) (9)
- Balloon Popping With Applications to Ascending Auctions (2007) (9)
- Approximate Efficiency in Matching Markets (2017) (9)
- Combinatorial Assortment Optimization (2017) (8)
- Web and Internet Economics (2013) (7)
- Influence Maximization with an Unknown Network by Exploiting Community Structure (2017) (7)
- The Role of Referrals in Immobility, Inequality, and Inefficiency in Labor Markets (2020) (6)
- Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates (2020) (6)
- Incentivizing Exploration with Unbiased Histories (2018) (6)
- The Role of Referrals in Inequality, Immobility, and Inefficiency in Labor Markets (2020) (6)
- When to Be Agile: Ratings and Version Updates in Mobile Apps (2019) (6)
- A Combinatorial Allocation Mechanism for Banner Advertisement with Penalties (2008) (6)
- Lower bounds for cost sharing and group-strategyproof mechanisms (6)
- Social Learning Under Platform Influence: Extreme Consensus and Persistent Disagreement (2020) (6)
- On Budget-Balanced Group-Strategyproof Cost-Sharing Mechanisms (2012) (5)
- Designing Approximately Optimal Search on Matching Platforms (2021) (5)
- Quadratic voting with multiple alternatives (2019) (5)
- Persuading with Anecdotes (2021) (4)
- When optimizing nonlinear objectives is no harder than linear objectives (2018) (4)
- Optimal marketing and pricing over social networks (2010) (4)
- On the Impossibility of Black-Box Transformations in Mechanism Design (2011) (4)
- Algorithmic Signaling of Features in Auction Design (2015) (4)
- Asynchronous Majority Dynamics in Preferential Attachment Trees (2019) (4)
- Socially Stable Matchings (2013) (3)
- First-Price Procurement Auctions (2010) (3)
- Social Presence in Virtual Event Spaces (2022) (3)
- Sharing Rival Information (2014) (3)
- Bid Optimization in Online Advertisement Auctions (2016) (3)
- Striving for social status (2012) (3)
- On the Impossibility of Black-Box Truthfulness Without Priors (2011) (2)
- Social Learning under Platform Influence: Consensus and Persistent Disagreement (2022) (2)
- Verifying Identity as a Social Intersection (2019) (2)
- Diversity and Exploration in Social Learning (2019) (2)
- Contract Design for Afforestation Programs (2020) (2)
- The Disparate Effects of Strategic Classification (2018) (2)
- The role of compatibility in the diffusion of technologies in social networks (2006) (2)
- Incentivizing Bandit Exploration: Recommendations as Instruments (2020) (2)
- A New Consensus Protocol: Quadratic Voting With Multiple Alternatives (2019) (2)
- On the Effect of Triadic Closure on Network Segregation (2022) (2)
- A Optimal User Search (2012) (1)
- Interactions across multiple games: cooperation, corruption, and organizational design (2022) (1)
- Maximizing the Spread of Influence from Training Data (2017) (1)
- Raffles (2017) (1)
- Letter from SIGecom executive committee (2020) (1)
- Equality of Power and Fair Public Decision-Making (2019) (1)
- Finding Bidder-Optimal Core Points Quickly (2016) (1)
- The (Non)-Existence of Stable Mechanisms in Incomplete Information Environments (2015) (1)
- The Design of Everyday Markets (2019) (1)
- PASS Approximation: A Framework for Analyzing and Designing Heuristics (2012) (1)
- G T ] 1 2 Ju l 2 01 9 Asynchronous Majority Dynamics in Preferential Attachment Trees (2019) (1)
- Revenue Maximization for Buyers with Outside Options (2021) (1)
- Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees (2005) (1)
- Reducing Inefficiency in Carbon Auctions with Imperfect Competition (2019) (1)
- Introduction to the Special Issue on WINE'13 (2015) (1)
- Matching Markets with Transfers and Salaries (DRAFT: Not for distribution) (2021) (1)
- When does Competition and Costly Information Acquisition Lead to a Deadlock? (2020) (1)
- Buying Data Over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions (2021) (1)
- Content Filtering with Inattentive Information Consumers (2022) (0)
- In Which Matching Markets Do Costly Compatibility Inspections Lead to a Deadlock? (2021) (0)
- A Faster Algorithm for Bidder-Optimal Core Points (2016) (0)
- On the Impact of Information Acquisition and Aftermarkets on Auction Efficiency (2021) (0)
- Technology Diffusion in Social Networks (2009) (0)
- Why I don't rob banks for a living (2011) (0)
- How to approximate optimal auctions (2012) (0)
- Proceedings of the 9th International Conference on Web and Internet Economics - Volume 8289 (2013) (0)
- Session details: Economics (2009) (0)
- Communicating with Anecdotes (2022) (0)
- Cost Sharing Schemes May 18 , 2005 Lecturer : (2005) (0)
- Robust , dynamic influence maximization (2017) (0)
- Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009) (2012) (0)
- Optimal Credit Scores Under Adverse Selection (2022) (0)
- Technical perspective: A graph-theoretic framework traces task planning (2018) (0)
- N ov 2 01 7 Combinatorial Assortment Optimization (2017) (0)
- Incentives in Large Random Two-Sided Markets1 (2015) (0)
- Kudu: An Electronic Agricultural Marketplace in Uganda (2022) (0)
- Certification Design for a Competitive Market (2023) (0)
- Session details: Internet monetization: recommendation and security (2008) (0)
- Tutorial Proposal : Mechanism Design for Online Advertisement (2006) (0)
- Letter from SIGecom executive committee (2020) (0)
- Two-Sided Markets: Stable Matching (DRAFT: Not for distribution) (2021) (0)
- Efficiency in Collective Decision-Making via Quadratic Transfers (2023) (0)
- Cooperation in Anonymous Dynamic Social Networks ∗ Preliminary Working Paper (2013) (0)
- Data acquisition system design for the Alpha Magnetic Spectrometer experiment (2002) (0)
- Letter from SIGecom executive committee (2021) (0)
- A Formal Treatment of Lamport’s Paxos Algorithm (2021) (0)
- Efficiency Guarantees in Large Markets (2016) (0)
- One-Sided Matching Markets (DRAFT: Not for distribution) (2021) (0)
- Making Auctions Robust to Aftermarkets (2021) (0)
- Manuscript-An Analysis of One-Dimensional Schelling Segregation (2016) (0)
This paper list is powered by the following services:
Other Resources About Nicole Immorlica
What Schools Are Affiliated With Nicole Immorlica?
Nicole Immorlica is affiliated with the following schools:
