World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
36
Citations
6133
World Ranking
11182
National Ranking
4632

Overview

Aleksandrs Slivkins is affiliated with Microsoft (United States) and actively contributes to research in decision sciences and computer science. Their work primarily focuses on management science and operations research, with significant involvement in artificial intelligence, marketing, economics and econometrics, and information systems.

The scientist's research spans key topics such as advanced bandit algorithms research, auction theory and applications, consumer market behavior and pricing, machine learning and algorithms, reinforcement learning in robotics, optimization and search problems, and smart grid energy management.

Frequent coauthors collaborating with Slivkins include Brendan Lucier, Nicole Immorlica, Zhiwei Steven Wu, Max Simchowitz, and Yishay Mansour.

Aleksandrs Slivkins has published extensively in several venues, notably:

  • arXiv (Cornell University)
  • Operations Research
  • ACM SIGecom Exchanges
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Mathematics of Operations Research

Selected recent papers by the scientist include:

  • Corruption-Robust Exploration in Episodic Reinforcement Learning, 2024, Mathematics of Operations Research
  • Bayesian Exploration: Incentivizing Exploration in Bayesian Games, 2021, Operations Research
  • Adversarial Bandits with Knapsacks, 2022, Journal of the ACM
  • Constrained episodic reinforcement learning in concave-convex and knapsack settings, 2020, arXiv (Cornell University)
  • Exploration and Incentives in Reinforcement Learning, 2023, Operations Research

Best Publications

  • Meridian: a lightweight network location service without virtual coordinates

    Bernard Wong;Aleksandrs Slivkins;Emin Gün Sirer

  • Multi-armed bandits in metric spaces

    Robert Kleinberg;Aleksandrs Slivkins;Eli Upfal

  • Bandits with Knapsacks

    Ashwinkumar Badanidiyuru;Robert Kleinberg;Aleksandrs Slivkins

  • Contextual bandits with similarity information

    Aleksandrs Slivkins

  • Introduction to Multi-Armed Bandits

    Aleksandrs Slivkins

  • Distance estimation and object location via rings of neighbors

    Aleksandrs Slivkins

  • Truthful Mechanisms with Implicit Payment Computation

    Moshe Babaioff;Robert D. Kleinberg;Aleksandrs Slivkins

  • Triangulation and embedding using small sets of beacons

    Jon Kleinberg;Aleksandrs Slivkins;Tom Wexler

  • The Best of Both Worlds: Stochastic and Adversarial Bandits

    Sébastien Bubeck;Aleksandrs Slivkins

  • Characterizing Truthful Multi-armed Bandit Mechanisms

    Moshe Babaioff;Yogeshwer Sharma;Aleksandrs Slivkins

  • Dynamic pricing with limited supply

    Moshe Babaioff;Shaddin Dughmi;Robert Kleinberg;Aleksandrs Slivkins

  • Bayesian Incentive-Compatible Bandit Exploration

    Yishay Mansour;Aleksandrs Slivkins;Vasilis Syrgkanis

  • Adapting to a Changing Environment: the Brownian Restless Bandits.

    Aleksandrs Slivkins;Eli Upfal

  • One practical algorithm for both stochastic and adversarial bandits

    Yevgeny Seldin;Aleksandrs Slivkins

  • Characterizing truthful multi-armed bandit mechanisms: extended abstract

    Moshe Babaioff;Yogeshwer Sharma;Aleksandrs Slivkins

  • Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs

    Aleksandrs Slivkins

  • Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems

    Chien-Ju Ho;Aleksandrs Slivkins;Jennifer Wortman Vaughan

  • Online decision making in crowdsourcing markets: theoretical challenges

    Aleksandrs Slivkins;Jennifer Wortman Vaughan

  • Ranked bandits in metric spaces: learning diverse rankings over large document collections

    Aleksandrs Slivkins;Filip Radlinski;Sreenivas Gollapudi

  • Resourceful Contextual Bandits

    Ashwinkumar Badanidiyuru;John Langford;Aleksandrs Slivkins

  • Bandits and Experts in Metric Spaces

    Robert Kleinberg;Aleksandrs Slivkins;Eli Upfal

  • Adversarial Bandits with Knapsacks

    Nicole Immorlica;Karthik Abinav Sankararaman;Robert Schapire;Aleksandrs Slivkins

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens doors to many related fields that offer excellent online education options and diverse career opportunities. For learners seeking a faster route, consider an accelerated cs degree, which allows you to complete your studies in a shorter time frame and quickly enter the tech workforce.

If your interests blend technology and sustainability, pursuing an environmental engineering degree can prepare you for careers focused on developing solutions to environmental challenges. Those drawn to design and innovation in the physical world may consider an online degree in mechanical engineering for roles in robotics, manufacturing, and more.

For a deeper understanding of the physical laws that underpin modern technology, the cheapest online physics degree options provide an affordable pathway to careers in research, engineering, and teaching. These online programs are flexible and budget-friendly, making advanced education more accessible than ever.

Trending Scientists

Recently Published Articles