Publications: Aleksandrs Slivkins
Download CSV for Aleksandrs Slivkins
| Title | Year | Citations | Score |
|---|---|---|---|
|
Introduction to multi-armed bandits
Foundations and Trends in Machine Learning 12 (1-2), 1-286, 2019 View Details |
2019 | 1471 | 99.6% |
|
Competing bandits: The perils of exploration under competition
ACM Transactions on Economics and Computation 13 (1), 1-47, 2025 View Details |
2025 | 78 | 98.8% |
|
Bandits and experts in metric spaces
Journal of the ACM (JACM) 66 (4), 30, 2019 View Details |
2019 | 688 | 98.7% |
|
Can large language models explore in-context?
Advances in Neural Information Processing Systems 37, 120124-120158, 2025 View Details |
2025 | 45 | 97.9% |
|
Adversarial Bandits with Knapsacks
Journal of the ACM 69 (6), 1-47, 2022 View Details |
2022 | 168 | 97.8% |
|
Bandits with knapsacks
Journal of the ACM (JACM) 65 (3), 13, 2018 View Details |
2018 | 593 | 97.8% |
|
Bayesian exploration: Incentivizing exploration in Bayesian games
Operations Research 70 (2), 1105-1127, 2022 View Details |
2022 | 148 | 97.4% |
|
Contextual bandits with similarity information
The Journal of Machine Learning Research 15 (1), 2533-2568, 2014 View Details |
2014 | 508 | 96.5% |
|
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
Journal of Machine Learning Research 25 (394), 1-37, 2024 View Details |
2024 | 44 | 95.8% |
|
Autobidders with budget and roi constraints: Efficiency, regret, and pacing dynamics
The Thirty Seventh Annual Conference on Learning Theory, 3642-3643, 2024 View Details |
2024 | 44 | 95.8% |
|
Meridian: A lightweight network location service without virtual coordinates
ACM SIGCOMM Computer Communication Review 35 (4), 85-96, 2005 View Details |
2005 | 585 | 95.1% |
|
Corruption-robust exploration in episodic reinforcement learning
Conference on Learning Theory, 3242-3245, 2021 View Details |
2021 | 139 | 95.0% |
|
Bayesian incentive-compatible bandit exploration
Operations Research 68 (4), 1132-1161, 2020 View Details |
2020 | 191 | 94.7% |
|
Exploration and incentives in reinforcement learning
Operations Research 72 (3), 983-998, 2024 View Details |
2024 | 30 | 93.5% |
|
The best of both worlds: stochastic and adversarial bandits
Conference on Learning Theory, 42.1-42.23, 2012 View Details |
2012 | 296 | 91.7% |
|
Dynamic pricing with limited supply
ACM Transactions on Economics and Computation (TEAC) 3 (1), 4, 2015 View Details |
2015 | 224 | 90.9% |
|
Incentivizing high quality crowdwork
Proceedings of the 24th International Conference on World Wide Web, 419-429, 2015 View Details |
2015 | 216 | 90.5% |
|
Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems
Journal of Artificial Intelligence Research 55, 317-359, 2016 View Details |
2016 | 179 | 89.3% |
|
Strategic Budget Selection in a Competitive Autobidding World
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 213-224, 2024 View Details |
2024 | 19 | 89.0% |
|
Characterizing truthful multi-armed bandit mechanisms
SIAM Journal on Computing 43 (1), 194-230, 2014 View Details |
2014 | 201 | 88.9% |
|
Making contextual decisions with low technical debt
arXiv preprint arXiv:1606.03966, 2016 View Details |
2016 | 172 | 88.9% |
|
One practical algorithm for both stochastic and adversarial bandits
International Conference on Machine Learning, 1287-1295, 2014 View Details |
2014 | 198 | 88.7% |
|
Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence
arXiv preprint arXiv:2205.08674, 2022 View Details |
2022 | 42 | 88.3% |
|
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM) 56 (6), 32, 2009 View Details |
2009 | 240 | 87.8% |
|
Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting
Journal of Machine Learning Research 21 (137), 1-45, 2020 View Details |
2020 | 89 | 87.2% |
|
Contextual dueling bandits
COLT 2015 (Conference on Learning Theory), 2015 View Details |
2015 | 157 | 86.4% |
|
Resourceful contextual bandits
Conference on Learning Theory, 1109-1134, 2014 View Details |
2014 | 162 | 86.0% |
|
Ranked bandits in metric spaces: learning diverse rankings over large document collections
Journal of Machine Learning Research 14 (Feb), 399-436, 2013 View Details |
2013 | 163 | 85.0% |
|
Adapting to a Changing Environment: the Brownian Restless Bandits.
COLT, 343-354, 2008 View Details |
2008 | 188 | 83.7% |
|
Generative AI as Economic Agents
ACM SIGecom Exchanges 22 (1), 93-109, 2024 View Details |
2024 | 13 | 83.5% |
|
Truthful mechanisms with implicit payment computation
Journal of the ACM (JACM) 62 (2), 1-37, 2015 View Details |
2015 | 131 | 83.5% |
|
Incentivizing Exploration with Selective Data Disclosure
ACM Conference on Economics and Computation, 2020 View Details |
2020 | 68 | 83.1% |
|
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity
Proceedings of the 22nd ACM Conference on Economics and Computation, 795-796, 2021 View Details |
2021 | 47 | 82.5% |
|
Constrained episodic reinforcement learning in concave-convex and knapsack settings
Advances in Neural Information Processing Systems 33, 16315-16326, 2020 View Details |
2020 | 65 | 82.3% |
|
Oracle-efficient pessimism: Offline policy optimization in contextual bandits
International Conference on Artificial Intelligence and Statistics, 766-774, 2024 View Details |
2024 | 12 | 82.3% |
|
Bandit Social Learning under Myopic Behavior
Advances in Neural Information Processing Systems 36, 2024 View Details |
2024 | 12 | 82.3% |
|
Robust Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
Proceedings of the AAAI Conference on Artificial Intelligence 39 (13), 13814 …, 2025 View Details |
2025 | 6 | 80.9% |
|
The externalities of exploration and how data diversity helps exploitation
COLT 2018 (Conference on Learning Theory), 2018 View Details |
2018 | 86 | 80.7% |
|
Distance estimation and object location via rings of neighbors
Distributed Computing 19 (4), 313-333, 2007 View Details |
2007 | 149 | 79.0% |
|
Online decision making in crowdsourcing markets: Theoretical challenges
ACM SIGecom Exchanges 12 (2), 4-23, 2013 View Details |
2013 | 105 | 76.9% |
|
Parameterized tractability of edge-disjoint paths on directed acyclic graphs
SIAM Journal on Discrete Mathematics 24 (1), 146-157, 2010 View Details |
2010 | 125 | 76.8% |
|
Combinatorial Semi-Bandits with Knapsacks
AISTATS (Intl. Conf. on Artificial Intelligence and Statistics), 1760-1770, 2018 View Details |
2018 | 68 | 76.0% |
|
Bayesian Exploration with Heterogeneous Agents
The World Wide Web Conference, 751-761, 2019 View Details |
2019 | 55 | 75.4% |
|
Efficient contextual bandits with continuous actions
Advances in Neural Information Processing Systems 33, 349-360, 2020 View Details |
2020 | 44 | 74.3% |
|
Metric embeddings with relaxed guarantees
SIAM Journal on Computing 38 (6), 2303-2329, 2009 View Details |
2009 | 110 | 74.2% |
|
Algorithmic persuasion through simulation
arXiv preprint arXiv:2311.18138, 2023 View Details |
2023 | 11 | 73.7% |
|
Impact of Decentralized Learning on Player Utilities in Stackelberg Games
arXiv preprint arXiv:2403.00188, 2024 View Details |
2024 | 8 | 73.0% |
|
Exploration and persuasion
Online and Matching-Based Market Design, F. Echenique, N. Immorlica, and V …, 2023 View Details |
2023 | 10 | 71.4% |
|
Incentivizing combinatorial bandit exploration
Advances in Neural Information Processing Systems 35, 37173-37183, 2022 View Details |
2022 | 17 | 70.8% |
|
Bandits with knapsacks beyond the worst case
Advances in Neural Information Processing Systems 34, 23191-23204, 2021 View Details |
2021 | 27 | 70.1% |
|
Adaptive Discretization for Adversarial Lipschitz Bandits
Conference on Learning Theory (COLT), 3788-3805, 2021 View Details |
2021 | 26 | 69.2% |
|
Adaptive crowdsourcing algorithms for the bandit survey problem
Conference on learning theory, 882-910, 2013 View Details |
2013 | 72 | 68.3% |
|
Network failure detection and graph connectivity
SIAM Journal on Computing 38 (4), 1330-1346, 2008 View Details |
2008 | 81 | 66.7% |
|
Multi-armed bandits on implicit metric spaces
Advances in Neural Information Processing Systems 24, 2011 View Details |
2011 | 70 | 65.2% |
|
Multidimensional dynamic pricing for welfare maximization
ACM Transactions on Economics and Computation (TEAC) 8 (1), 1-35, 2020 View Details |
2020 | 29 | 63.7% |
|
Identifying subgraphs in transformed social network graphs
US Patent 9,439,053, 2016 View Details |
2016 | 44 | 60.4% |
|
Low-distortion inference of latent similarities from a multiplex social network
SIAM Journal on Computing 44 (3), 617-668, 2015 View Details |
2015 | 42 | 56.9% |
|
Selection and influence in cultural dynamics
Network Science 4 (1), 1-27, 2016 View Details |
2016 | 36 | 54.8% |
|
How many workers to ask?: Adaptive exploration for collecting high quality labels
Proceedings of the 39th International ACM SIGIR conference on Research and …, 2016 View Details |
2016 | 35 | 54.1% |
|
Distributed approaches to triangulation and embedding
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005 View Details |
2005 | 39 | 50.3% |
|
Dynamic ad allocation: Bandits with budgets
arXiv preprint arXiv:1306.0155, 2013 View Details |
2013 | 34 | 49.4% |
|
Harvesting Randomness to Optimize Distributed Systems
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, 178-184, 2017 View Details |
2017 | 23 | 45.4% |
|
Should You Use Your Large Language Model to Explore or Exploit?
arXiv preprint arXiv:2502.00225, 2025 View Details |
2025 | 2 | 44.3% |
|
Multi-parameter mechanisms with implicit payment computation
Proceedings of the fourteenth ACM conference on Electronic commerce, 35-52, 2013 View Details |
2013 | 24 | 41.4% |
|
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 View Details |
2021 | 10 | 41.3% |
|
Truthful Online Scheduling of Cloud Workloads under Uncertainty
Proceedings of the ACM Web Conference 2022, 151-161, 2022 View Details |
2022 | 6 | 39.9% |
|
Approximate matching for peer-to-peer overlays with cubit
View Details |
2008 | 20 | 37.6% |
|
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of …, 2007 View Details |
2007 | 20 | 37.6% |
|
Incentivizing exploration via information asymmetry
XRDS: Crossroads, The ACM Magazine for Students 24 (1), 38-41, 2017 View Details |
2017 | 13 | 32.5% |
|
Oscillations with TCP-like flow control in networks of queues
INFOCOM 2006 (5th IEEE Intl. Conf. on Computer Communications), 2006 View Details |
2006 | 14 | 32.5% |
|
Application testing
US Patent 11,182,280, 2021 View Details |
2021 | 6 | 27.9% |
|
Application testing
US Patent 10,284,664, 2019 View Details |
2019 | 8 | 27.1% |
|
A Polynomial Time Algorithm for Spatio-Temporal Security Games
Proceedings of the 2017 ACM Conference on Economics and Computation, 697-714, 2017 View Details |
2017 | 9 | 25.7% |
|
Incentivized Exploration via Filtered Posterior Sampling
Proceedings of the 25th ACM Conference on Economics and Computation, 1200-1200, 2024 View Details |
2024 | 2 | 25.7% |
|
Monotone multi-armed bandit allocations
Proceedings of the 24th Annual Conference on Learning Theory, 829-834, 2011 View Details |
2011 | 7 | 21.5% |
|
Embedding, distance estimation and object location in networks
View Details |
2006 | 6 | 20.7% |
|
Learning diverse rankings over document collections
US Patent App. 12/764,112, 2011 View Details |
2011 | 6 | 19.5% |
|
Adapting to the shifting intent of search queries
Advances in Neural Information Processing Systems, 1829-1837, 2009 View Details |
2009 | 5 | 17.9% |
|
Interleaving schemes on circulant graphs with two offsets
Discrete Mathematics 309 (13), 4384-4398, 2009 View Details |
2009 | 5 | 17.9% |
|
Dynamic Pricing Under Model Uncertainty
Tutorial given at the 16th ACM Conference on Economics and Computation, 2015 View Details |
2015 | 5 | 16.5% |
|
Tutorial: incentivizing and coordinating exploration
Proceedings of the 18th ACM conference on economics and computation, Cambridge, 2017 View Details |
2017 | 4 | 14.5% |
|
Crowdsourcing gold-hit creation at scale: Challenges and adaptive exploration approaches
HCOMP 2013 workshop, 2013 View Details |
2013 | 4 | 14.1% |
|
Multiworld testing decision service: A system for experimentation, learning, and decision-making
Whitepaper of Microsoft, 1-40, 2016 View Details |
2016 | 4 | 13.7% |
|
Sayer: Using Implicit Feedback to Optimize System Policies
Proceedings of the ACM Symposium on Cloud Computing, 273-288, 2021 View Details |
2021 | 2 | 8.2% |
|
On Fixed-parameter tractability of some routing problems
Cornell University, 2002 View Details |
2002 | 2 | 6.9% |
|
Robust Multi-objective Learning with Mentor Feedback
Conference on Learning Theory, 726-741, 2014 View Details |
2014 | 2 | 6.3% |
|
Payment determination in auctions
US Patent App. 12/939,192, 2012 View Details |
2012 | 2 | 6.3% |
|
The Agentic Economy
arXiv preprint arXiv:2505.15799, 2025 View Details |
2025 | 1 | 0.0% |