Alex Slivkins

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

Bandit Social Learning under Myopic Behavior
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins
NeurIPS 2023

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

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

Corruption Robust Exploration in Episodic Reinforcement Learning
Thodoris Lykouris, Max Simchowitz, Aleksandrs Slivkins and Wen Sun
Mathematics of Operations Research, to appear in 2024.
Preliminary version in COLT 2021.

Competing Bandits: The Perils of Exploration Under Competition (rev. 2022)
Guy Aridor, Yishay Mansour, Aleksandrs Slivkins, and Zhiwei Steven Wu
Subsumes papers in ITCS 2018 and EC 2019.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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