Non-manipulability and Approachability Beyond Two-Player Games
AI Safety · Game Theory · Repeated Strategic Interaction
Welcome! I'm a MAPS Postdoctoral Fellow and SERC Postdoctoral Fellow at MIT. I got my PhD from the University of Pennsylvania, where I was fortunate to be advised by Michael Kearns and Aaron Roth.
I work on problems at the intersection of AI and Game Theory. I'm especially interested in understanding repeated strategic interactions between human and AI agents. My work has been awarded with an IBM PhD Fellowship in Trustworthy AI and a joint Best Paper Award/Best Student Paper Award from the ACM Conference for Economics and Computation.
I have been recognized as a Rising Star in EECS, my work has been featured in Quanta magazine, and I've given an ICML tutorial on trustworthy predictions.
I graduated from Princeton University in 2019, where I was fortunate to be advised by Matt Weinberg. From 2019–2021, I was a software engineer at Google. In Summer 2025 I was an intern at Microsoft Research New England, hosted by Alex Slivkins.
Recent News
- 10/2026: I’ll be doing some traveling this month: first to Switzerland for the Confluence@EPFL workshop (October 8–9), then to Venice for the SMART Workshop organized by the University of Warwick (October 23–24).
- 09/2026: Narrowing the Collaboration Gap, Probably accepted to NeurIPS 2026!
- 09/2026: The Sample Complexity of Multicalibration accepted to SODA 2027!
- 03/2026: Two papers accepted to ICML 2026!
- 03/2026: Our work on Pluralistic Alignment was awarded the Best Paper Award at the AIMS Workshop at ICLR!
- 02/2026: Our work on author self-rankings for ML conferences was featured in Nature Index.
- 11/2025: Our work on algorithmic collusion was featured in a recent Quanta article!
- 11/2025: Our paper Collaborative Prediction was accepted to SODA'26.
- 07/2025: Swap Regret and Correlated Equilibria Beyond Normal-Form Games won Best Paper and Best Student Paper at EC'25!
- 05/2025: Moved to Boston for the summer to start my internship at Microsoft Research New England, hosted by Alex Slivkins!
- 05/2025: Two papers accepted to EC'25!
- 02/2025: Co-organising the EC Gender Inclusion Workshop.
- 01/2025: Tractable Agreement Protocols accepted to STOC'25!
- 12/2024: Honored to receive an IBM PhD Fellowship!
- 12/2024: Gave a talk at the Junior Theorists Workshop in Chicago.
- 11/2024: Algorithmic Collusion Without Threats accepted to ITCS’25!
- 10/2024: Spoke at the FOCS Calibration Workshop on agreement protocols.
- 10/2024: Attended Cornell ORIE’s Young Researchers Workshop.
- 10/2024: An Elementary Predictor Obtaining 2√T Distance to Calibration accepted to SODA’25!
- 09/2024: Named one of MIT EECS Rising Stars!
- 05/2024: Three papers accepted to EC’24!
Research
I study AI safety through the lens of learning and strategic interaction. My work uses tools from game theory and learning theory to understand when interacting human and AI agents are safe and aligned, and when strategic dynamics instead produce manipulation, collusion, or other failures.
Note: In my field, authorship for papers is typically alphabetical. Author orderings below are alphabetical by default; when they are author-contribution order, the first author(s) are denoted with an asterisk.
Papers may appear in more than one research area.
In Submission / Working Papers
Delegating Authorization to Misaligned Agents: Coalitional Alignment and Safe Control
Personalization Aids Pluralistic Alignment via Competition
Best Paper Award at ICLR AIMS Workshop
Failure Modes in AI Retraining Dynamics
Oral at ICML NExT-Game Workshop
Breaking Algorithmic Collusion in Human-AI Ecosystems
The Value of Ambiguous Commitments in Multi-Follower Games
Revise and Resubmit at Games and Economic Behavior
Conference Publications
The Sample Complexity of Multicalibration
SODA 2027
Narrowing the Collaboration Gap, Probably
NeurIPS 2026
Optimal Lower Bounds for Online Multicalibration
FOCS 2026
Emergent Alignment via Competition
ICML 2026
Bandit Social Learning with Exploration Episodes
ICML 2026
Collaborative Prediction: Tractable Information Aggregation via Agreement
SODA 2026
Oral at EC 2025 Workshop on Human-AI Collaboration
Oral at 2025 TTIC Workshop on Incentives for Collaborative Learning and Data Sharing
Learning to Play Against Unknown Opponents
EC 2025
Swap Regret and Correlated Equilibria Beyond Normal-Form Games
EC 2025
EC Best Paper Award & Best Student Paper Award
Invited to Highlights of Algorithms (HALG)
STOC 2025
Pluralistic Alignment Workshop @ NeurIPS 2024
Algorithmic Collusion Without Threats
ITCS 2025
CSLaw 2025 (non-archival)
Media: The Game Theory of How Algorithms Can Drive Up Prices (Quanta Magazine)
An Elementary Predictor Obtaining 2√T Distance to Calibration
SODA 2025
ML-OPT Workshop @ NeurIPS 2024
Pareto-Optimal Algorithms for Learning in Games
EC 2024
ESIF Economics & AI+ML Meeting 2024
Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
EC 2024
ESIF Economics & AI+ML Meeting 2024
Efficient Prior-Free Mechanisms for No-Regret Agents
EC 2024
Efficient Stackelberg Strategies for Finitely Repeated Games
AAMAS 2023
Dynamic Weighted Matching with Heterogenous Arrival and Departure Rates
WINE 2020
On the (in)-approximability of Bayesian Mechanism Design for a Combinatorial Buyer
EC 2020
Journal Publications
Self-Rankings as a Predictor of Scientific Impact Beyond Peer Review
Nature Computational Science
The ICML 2023 Ranking Experiment: Examining Author Self-Assessment in ML/AI Peer Review
Journal of the American Statistical Association (JASA) Discussion Paper
Essays
Menus: A Framework for Learning Against Strategic Opponents
SIGecom Exchanges, Winter 2026
Theses
Learning to Play Well with Others
PhD thesis
Advised by Michael Kearns and Aaron Roth.
The Complexity of Mechanism Design Approximation
Undergraduate thesis
Senior thesis, 2019. Advised by Matt Weinberg. Outstanding Computer Science Thesis Prize, Sigma Xi Book Award.
Other Research
Recommending Best Paper Awards for ML/AI Conferences via the Isotonic Mechanism
Fastermind: Using a SAT-Solver to play Mastermind more efficiently
2018. Advised by Zachary Kincaid, as a Junior Independent Work project.
Maximizing Winnings on Final Jeopardy!
2017. REU-CAAR at University of Maryland.
Selected Talks & Tutorials
Selected seminars, workshops, invited talks, and tutorials, grouped by talk.
Calibration, Decisions, and Collaboration in Learning
- 2026 NSF AI-SDM Human-AI Complementarity Workshop — tutorial with Ira Globus-Harris
- ICML 2026 — invited tutorial with Aaron Roth and Ira Globus-Harris
Failure Modes in AI Retraining Dynamics
- ICML 2026 NExT-Game Workshop — oral presentation
Emergent Alignment via Competition
- 2026 ESIF Economics & AI+ML Meeting
- 2026 Simons Institute: Agency in Collaborative Learning
- 2025 UK AISI Alignment Conference
- 2025 Cornell Young Researchers Workshop
Learning and Incentives in Human-AI Collaboration
- 2026 NYU CS Colloquium
- 2026 TTIC Colloquium
- 2026 Simons Collaboration on the Theory of Algorithmic Fairness
- 2025 MIT Algorithms & Complexity Seminar
- 2025 Northeastern Theory Seminar
- 2025 CMU Theory Lunch
- 2025 NYU Theory Seminar
Swap Regret and Correlated Equilibria Beyond Normal-Form Games
- EC 2025 — Best Paper Talk
- 2025 Johns Hopkins Theory Seminar
- 2025 TCS+ Seminar
Collaborative Prediction
- 2025 EC Workshop on Human-AI Collaboration — oral presentation
- 2025 Caltech RSRG/FALCOM Seminar
- 2025 AWS Responsible AI Science Meeting
Tractable Agreement Protocols
- 2025 NYC Student Theory Day
- 2025 TOC4Fairness Seminar
- 2024 Junior Theorists Workshop
- 2024 Johns Hopkins Theory Seminar
- 2024 AWS Responsible AI Science Meeting
- FOCS 2024 Calibration Workshop
Writing & Resources
Media & Coverage
Work Experience
- Research Intern, Microsoft Research (2025)
- Software Engineer, Google Cloud (2019–2021)
- Research Intern, Microsoft Research (2019)
- Software Engineering Intern, Amazon Web Services (2018)
- Research Intern, REU-CAAR, University of Maryland (2017)
Teaching & Mentorship
- Head TA, Advanced Topics in ML (CIS 6200, UPenn)
- TA, New Horizons in TCS Summer School
- Head TA, Algorithmic Game Theory (NETS 4120, UPenn)
- Head TA, Introduction to Algorithms (CIS 3200, UPenn)
- TA, Reasoning About Computation (COS 340, Princeton)
Service
- Co-organizer, EC Gender Inclusion Workshop, 2024 and 2025
- Leader, UPenn Theory Seminar (2022–2025)
- PC Reviewer, EC 2026; WINE 2025; EC 2025; FAccT 2022
- Sub-reviewer, SODA 2025; FAccT 2024; SODA 2024; ITCS 2023; EC 2021
Awards & Honors
- Best Paper, EC 2025
- Best Paper with a Student Lead Author, EC 2025
- IBM PhD Fellowship (2025)
- Rising Star in EECS (2024)
- AWS AI ASSET Fellow (2023)
- NSF-GRFP Honorable Mention (2020)
- Sigma Xi Book Award (2019)
- Outstanding CS Senior Thesis, Princeton (2019)
Most Important Honors
Show list
- Best Costume, UPenn CS Halloween 2025
- Most Accurate Costume, UPenn CS Halloween 2024
- Most Orange Costume, UPenn CS Halloween 2023
- Judge, UPenn CS Halloween 2022
- First Place, UPenn CS Halloween 2021
Curriculum Vitae
Full CV (PDF) CV of Failures (PDF)
Every PhD has good and bad moments--so here's some of both.
Contact
Email: ncollina at seas dot upenn dot edu