Alex Slivkins

Here are a some representative publications that exemplify my interests.
Full publication list can be found here (opens in new tab) (with abstracts, by year and by topic).

Position papers on Agentic AI:
Generative AI as Economic Agents (opens in new tab) (Jun’24, with N. Immorlica and B. Lucier)
The Agentic Economy (opens in new tab) (May’25, with many others at MSR-NYC and MSR-NE).

Bandit Social Learning: Exploration under Myopic Behavior (opens in new tab)
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins
Under submission, preliminary version in NeurIPS 2023 (opens in new tab)

Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence (opens in new tab)
Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins
ITCS 2023 (opens in new tab) and Operations Research (opens in new tab) (under revision).

Exploration and Persuasion (invited chapter: a teachable survey),
In “Online and Matching-Based Markets (opens in new tab)“, Cambridge Univ. Press, 2023.

Corruption Robust Exploration in Episodic Reinforcement Learning (opens in new tab)
Thodoris Lykouris, Max Simchowitz, Aleksandrs Slivkins and Wen Sun
Mathematics of Operations Research (opens in new tab), Vol. 72(3), 2024.
Preliminary version in COLT 2021 (opens in new tab).

Competing Bandits: The Perils of Exploration Under Competition (rev. 2022)
Guy Aridor, Yishay Mansour, Aleksandrs Slivkins, and Zhiwei Steven Wu
ACM TEAC (opens in new tab): ACM Trans. on Economics and Computation, Vol. 13(1), 2025.
Subsumes papers in ITCS 2018 (opens in new tab) and EC 2019 (opens in new tab).

Adversarial Bandits with Knapsacks (opens in new tab) (rev. 2021)
Nicole Immorlica, Karthik A. Sankararaman, Aleksandrs Slivkins and Rob Schapire
J. of the ACM (opens in new tab), 2022. Preliminary version in FOCS 2019 (opens in new tab).

Bayesian Exploration: Incentivizing Exploration in Bayesian Games (rev. 2021)
Yishay Mansour, Aleksandrs Slivkins, Vasilis Syrgkanis and Steven Wu
Operations Research (opens in new tab), 70(2): 1105-1127, 2022. Preliminary version in EC 2016 (opens in new tab).

Bayesian Incentive-Compatible Bandit Exploration (opens in new tab) (rev. 2019)
Yishay Mansour, Aleksandrs Slivkins and Vasilis Syrgkanis
Operations Research (opens in new tab) 68(4): 1132-1161, 2020. Preliminary version in EC 2015. (opens in new tab)

Incentivizing High Quality Crowdwork (opens in new tab)
Chien-Ju Ho, Aleksandrs Slivkins, Siddharth Suri, and Jennifer Wortman Vaughan
WWW 2015 (opens in new tab): 24th Intl. World Wide Web Conference (Nominee for Best Paper Award).
Short version: SIGecom Exchanges (opens in new tab), Dec 2015.

Online Decision Making in Crowdsourcing Markets: Theoretical Challenges (opens in new tab)
[position paper & survey]
Aleksandrs Slivkins and Jennifer Wortman Vaughan
SIGecom Exchanges (opens in new tab), Dec 2013.

Bandits with Knapsacks (opens in new tab) (rev. 2017)
Ashwinkumar Badanidiyuru, Robert Kleinberg and Aleksandrs Slivkins.
FOCS 2013 (opens in new tab): IEEE Symp. on Foundations of Computer Science.
J. of the ACM (opens in new tab), Vol. 65 Issue 3, March 2018.

Low-distortion Inference of Latent Similarities from a Multiplex Social Network (opens in new tab)
Ittai Abraham, Shiri Chechik, David Kempe and Aleksandrs Slivkins.
SIAM J. on Computing (opens in new tab), Vol. 44(3), 2015.
SODA 2013 (opens in new tab): ACM-SIAM Symp. on Discrete Algorithms.

Dynamic pricing with limited supply (opens in new tab)
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg and Aleksandrs Slivkins
Special issue for EC 2012 (opens in new tab): ACM Trans. on Economics and Computation, 3(1): 4 (2015).

Truthful Mechanisms with Implicit Payment Computation (opens in new tab)
Moshe Babaioff, Robert Kleinberg and Aleksandrs Slivkins.
J. of the ACM (opens in new tab), Volume 62, Issue 2, May 2015.
EC 2010 (opens in new tab): ACM Symp. on Electronic Commerce (Best Paper Award).

Bandits and Experts in Metric Spaces (opens in new tab) (rev. 2018)
Robert Kleinberg, Aleksandrs Slivkins and Eli Upfal.
J. of the ACM (opens in new tab), Volume 66, Issue 4, May 2019.
Preliminary versions in STOC 2008 (opens in new tab) and  SODA 2010 (opens in new tab).

Meridian: A Lightweight Network Location Service without Virtual Coordinates (opens in new tab) (project (opens in new tab))
Bernard Wong, Aleksandrs Slivkins and Emin G. Sirer.
ACM SIGCOMM 2005 (opens in new tab).

Distance Estimation and Object Location via Rings of Neighbors (opens in new tab)
PODC 2005 (opens in new tab): ACM Symp. on Principles of Distributed Computing
      (Best Student Paper Award).
Special issue of “Distributed Computing” (opens in new tab): Vol. 19, No. 4. (March 2007).

Metric Embeddings with Relaxed Guarantees (opens in new tab)
T-H.H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg and A. Slivkins.
SIAM J. on Computing (opens in new tab), 38(6): 2303-2329, March 2009.
FOCS 2005 (opens in new tab): IEEE Symp. on Foundations of Computer Science.

Triangulation and Embedding using Small Sets of Beacons (opens in new tab)
Jon Kleinberg, Aleksandrs Slivkins and Tom Wexler.
J. of the ACM (opens in new tab), 56(6), Sept 2009.
FOCS 2004 (opens in new tab): IEEE Symp. on Foundations of Computer Science.

Ph.D. Thesis: Embedding, Distance Estimation and Object Location in Networks (opens in new tab) (2006).