default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicole Immorlica
- > Home > Persons > Nicole Immorlica
Publications
- 2024
[c100]Ian Ball, James W. Bono, Justin Grana, Nicole Immorlica, Brendan Lucier, Aleksandrs Slivkins:
Content Filtering with Inattentive Information Consumers. AAAI 2024: 9485-9493- [c99]Nicole Immorlica, Brendan Lucier, Markus Mobius, James Siderius:
Online Algorithms with Limited Data Retention (Extended Abstract). FORC 2024: 10:1-10:8 - [c98]Kate Donahue, Nicole Immorlica, Meena Jagadeesan, Brendan Lucier, Aleksandrs Slivkins:
Impact of Decentralized Learning on Player Utilities in Stackelberg Games. ICML 2024 - [c97]Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Markus Mobius, Divyarthi Mohan:
Communicating with Anecdotes (Extended Abstract). ITCS 2024: 57:1-57:2 - [c96]Yannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier:
Revenue Maximization for Buyers with Costly Participation. SODA 2024: 41-73 - [c95]Nicole Immorlica
, Meena Jagadeesan, Brendan Lucier:
Clickbait vs. Quality: How Engagement-Based Optimization Shapes the Content Landscape in Online Platforms. WWW 2024: 36-45 - [i47]Nicole Immorlica, Meena Jagadeesan, Brendan Lucier:
Clickbait vs. Quality: How Engagement-Based Optimization Shapes the Content Landscape in Online Platforms. CoRR abs/2401.09804 (2024) - [i46]Kate Donahue, Nicole Immorlica, Meena Jagadeesan, Brendan Lucier, Aleksandrs Slivkins:
Impact of Decentralized Learning on Player Utilities in Stackelberg Games. CoRR abs/2403.00188 (2024) - [i45]Nicole Immorlica, Brendan Lucier, Markus Mobius, James Siderius:
Online Algorithms with Limited Data Retention. CoRR abs/2404.10997 (2024) - 2023
- [j31]Nicole Immorlica, Brendan Lucier, Vahideh H. Manshadi, Alexander Wei:
Designing Approximately Optimal Search on Matching Platforms. Manag. Sci. 69(8): 4609-4626 (2023) - [c94]Moshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier:
Making Auctions Robust to Aftermarkets. ITCS 2023: 9:1-9:23 - [i44]Andreas A. Haupt, Nicole Immorlica, Brendan Lucier:
Certification Design for a Competitive Market. CoRR abs/2301.13449 (2023) - [i43]Keegan Harris, Nicole Immorlica, Brendan Lucier, Aleksandrs Slivkins:
Algorithmic Persuasion Through Simulation: Information Design in the Age of Generative AI. CoRR abs/2311.18138 (2023) - 2022
- [j30]Rad Niazadeh, Jason D. Hartline, Nicole Immorlica, Mohammad Reza Khani, Brendan Lucier:
Fast Core Pricing for Rich Advertising Auctions. Oper. Res. 70(1): 223-240 (2022) - [c92]Rediet Abebe, Nicole Immorlica, Jon M. Kleinberg, Brendan Lucier, Ali Shirali:
On the Effect of Triadic Closure on Network Segregation. EC 2022: 249-284 - [i42]Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Markus Mobius, Divyarthi Mohan:
Communicating with Anecdotes. CoRR abs/2205.13461 (2022) - [i41]Rediet Abebe, Nicole Immorlica, Jon M. Kleinberg, Brendan Lucier, Ali Shirali:
On the Effect of Triadic Closure on Network Segregation. CoRR abs/2205.13658 (2022) - 2021
- [j26]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. ACM Trans. Economics and Comput. 9(1): 5:1-5:34 (2021) - [c90]Nicole Immorlica, Ian A. Kash, Brendan Lucier:
Buying Data over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions. ITCS 2021: 77:1-77:14 - [c89]Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier:
Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract). ITCS 2021: 84:1-84:1 - [c88]Nicole Immorlica, Brendan Lucier, Vahideh H. Manshadi, Alexander Wei:
Designing Approximately Optimal Search on Matching Platforms. EC 2021: 632-633 - [c87]Wanyi Dai Li, Nicole Immorlica, Brendan Lucier:
Contract Design for Afforestation Programs. WINE 2021: 113-130 - [i40]Nicole Immorlica, Ian A. Kash, Brendan Lucier:
Buying Data Over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions. CoRR abs/2101.07304 (2021) - [i39]Nicole Immorlica, Brendan Lucier, Vahideh H. Manshadi, Alexander Wei:
Designing Approximately Optimal Search on Matching Platforms. CoRR abs/2102.09017 (2021) - [i38]Yannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier:
Revenue Maximization for Buyers with Outside Options. CoRR abs/2103.03980 (2021) - [i37]Moshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier:
On the Impact of Information Acquisition and Aftermarkets on Auction Efficiency. CoRR abs/2107.05853 (2021) - 2020
- [j25]Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
A Simple and Approximately Optimal Mechanism for an Additive Buyer. J. ACM 67(4): 24:1-24:40 (2020) - [c84]Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Jack Z. Wang:
Maximizing Welfare with Incentive-Aware Evaluation Mechanisms. IJCAI 2020: 160-166 - [c83]Kira Goldner, Nicole Immorlica, Brendan Lucier:
Reducing Inefficiency in Carbon Auctions with Imperfect Competition. ITCS 2020: 15:1-15:21 - [c80]Natalie Collina, Nicole Immorlica, Kevin Leyton-Brown, Brendan Lucier, Neil Newman:
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates. WINE 2020: 17-30 - [i35]Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Jack Z. Wang:
Maximizing Welfare with Incentive-Aware Evaluation Mechanisms. CoRR abs/2011.01956 (2020) - [i34]Natalie Collina, Nicole Immorlica, Kevin Leyton-Brown, Brendan Lucier, Neil Newman:
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates. CoRR abs/2012.00689 (2020) - [i33]Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier:
Non-quasi-linear Agents in Quasi-linear Mechanisms. CoRR abs/2012.02893 (2020) - 2019
- [i29]Kira Goldner, Nicole Immorlica, Brendan Lucier:
Reducing Inefficiency in Carbon Auctions with Imperfect Competition. CoRR abs/1912.06428 (2019) - 2018
- [c70]Neil Newman, Lauren Falcao Bergquist, Nicole Immorlica, Kevin Leyton-Brown, Brendan Lucier, Craig McIntosh, John A. Quinn, Richard Ssekibuule:
Designing and Evolving an Electronic Agricultural Marketplace in Uganda. COMPASS 2018: 14:1-14:11 - [c67]Yiling Chen, Nicole Immorlica, Brendan Lucier, Vasilis Syrgkanis, Juba Ziani:
Optimal Data Acquisition for Statistical Estimation. EC 2018: 27-44 - [c66]Jason D. Hartline, Nicole Immorlica, Mohammad Reza Khani, Brendan Lucier, Rad Niazadeh:
Fast Core Pricing for Rich Advertising Auctions. EC 2018: 111-112 - [c65]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. WINE 2018: 218-231 - 2017
- [c61]Nicole Immorlica, Brendan Lucier, Emmanouil Pountourakis, Samuel Taggart:
Repeated Sales with Multiple Strategic Buyers. EC 2017: 167-168 - [c60]Nicole Immorlica, Robert Kleinberg, Brendan Lucier, Morteza Zadomighaddam:
Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals. SODA 2017: 984-993 - [c59]Nicole Immorlica, Brendan Lucier, E. Glen Weyl, Joshua Mollner:
Approximate Efficiency in Matching Markets. WINE 2017: 252-265 - [i21]Yiling Chen, Nicole Immorlica, Brendan Lucier, Vasilis Syrgkanis, Juba Ziani:
Optimal Data Acquisition for Statistical Estimation. CoRR abs/1711.01295 (2017) - [i20]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. CoRR abs/1711.02601 (2017) - 2016
- [c58]Nick Gravin, Nicole Immorlica, Brendan Lucier, Emmanouil Pountourakis:
Procrastination with Variable Present Bias. EC 2016: 361 - [c57]Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis:
The price of anarchy in large games. STOC 2016: 963-976 - [c56]Darrell Hoy, Nicole Immorlica, Brendan Lucier:
On-Demand or Spot? Selling the Cloud to Risk-Averse Customers. WINE 2016: 73-86 - [i19]Nick Gravin, Nicole Immorlica, Brendan Lucier, Emmanouil Pountourakis:
Procrastination with variable present bias. CoRR abs/1606.03062 (2016) - [i18]Jason D. Hartline, Nicole Immorlica, Brendan Lucier, Rad Niazadeh:
Finding Bidder-Optimal Core Points Quickly. CoRR abs/1610.03564 (2016) - [i17]Darrell Hoy, Nicole Immorlica, Brendan Lucier:
On-demand or Spot? Selling the cloud to risk-averse customers. CoRR abs/1612.06347 (2016) - 2015
- [c55]Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis:
A Unifying Hierarchy of Valuations with Complements and Substitutes. AAAI 2015: 872-878 - [c53]Hu Fu, Nicole Immorlica, Brendan Lucier, Philipp Strack:
Randomization Beats Second Price as a Prior-Independent Auction. EC 2015: 323 - [c52]Nick Arnosti, Nicole Immorlica, Brendan Lucier:
The (Non)-Existence of Stable Mechanisms in Incomplete Information Environments. WINE 2015: 46-59 - [i16]Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis:
The Price of Anarchy in Large Games. CoRR abs/1503.04755 (2015) - [i15]Nick Arnosti, Nicole Immorlica, Brendan Lucier:
The (Non)-Existence of Stable Mechanisms in Incomplete Information Environments. CoRR abs/1504.03257 (2015) - [i14]Hu Fu, Nicole Immorlica, Brendan Lucier, Philipp Strack:
Randomization beats Second Price as a Prior-Independent Auction. CoRR abs/1507.08042 (2015) - [i13]Nicole Immorlica, Robert D. Kleinberg, Brendan Lucier, Morteza Zadomighaddam:
Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals. CoRR abs/1511.02537 (2015) - 2014
- [j18]Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
A simple and approximately optimal mechanism for an additive buyer. SIGecom Exch. 13(2): 31-35 (2014) - [c50]Michal Feldman, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks. APPROX-RANDOM 2014: 192-208 - [c49]Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
A Simple and Approximately Optimal Mechanism for an Additive Buyer. FOCS 2014: 21-30 - [i12]Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
A Simple and Approximately Optimal Mechanism for an Additive Buyer. CoRR abs/1405.6146 (2014) - [i11]Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis:
A Unifying Hierarchy of Valuations with Complements and Substitutes. CoRR abs/1408.1211 (2014) - [i10]Michal Feldman, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
Reaching Consensus via non-Bayesian Asynchronous Learning in Social Networks. CoRR abs/1408.5192 (2014) - [i9]Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis:
A Unifying Hierarchy of Valuations with Complements and Substitutes. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [c43]Shuchi Chawla, Nicole Immorlica, Brendan Lucier:
On the limits of black-box reductions in mechanism design. STOC 2012: 435-448 - 2011
- [c39]Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz:
Dueling algorithms. STOC 2011: 215-224 - [i4]Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz:
Dueling Algorithms. CoRR abs/1101.2883 (2011) - [i3]Shuchi Chawla, Nicole Immorlica, Brendan Lucier:
On the Impossibility of Black-Box Transformations in Mechanism Design. CoRR abs/1109.2067 (2011) - 2010
- [c37]Nicole Immorlica, Brendan Lucier, Brian Rogers:
Cooperation in anonymous dynamic social networks. EC 2010: 241-242
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
