Aleksandrs Slivkins

8 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0001-6899-6383

Microsoft Research New York

Publications

• Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression — Journal of Machine Learning Research 2024 (name-matched, not ORCID-linked)
• Exploration and Incentives in Reinforcement Learning — Operations Research 2024
• The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity — Operations Research 2023
• Bayesian Exploration: Incentivizing Exploration in Bayesian Games — Operations Research 2022
• Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting — Journal of Machine Learning Research 2020 (name-matched, not ORCID-linked)
• Bayesian Incentive-Compatible Bandit Exploration — Operations Research 2020
• Contextual Bandits with Similarity Information — Journal of Machine Learning Research 2014 (name-matched, not ORCID-linked)
• Ranked Bandits in Metric Spaces: Learning Diverse Rankings over Large Document Collections — Journal of Machine Learning Research 2013 (name-matched, not ORCID-linked)