Aleksandrs Slivkins

According to our database1, Aleksandrs Slivkins authored at least 89 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits.
SIAM J. Comput., April, 2023

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents.
CoRR, 2023

Algorithmic Persuasion Through Simulation: Information Design in the Age of Generative AI.
CoRR, 2023

Strategic Budget Selection in a Competitive Autobidding World.
CoRR, 2023

Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Bandits.
CoRR, 2023

Bandit Social Learning: Exploration under Myopic Behavior.
CoRR, 2023

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics.
CoRR, 2023

Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Adversarial Bandits with Knapsacks.
J. ACM, 2022

Bayesian Exploration: Incentivizing Exploration in Bayesian Games.
Oper. Res., 2022

Efficient Contextual Bandits with Knapsacks via Regression.
CoRR, 2022

Incentivizing Participation in Clinical Trials.
CoRR, 2022

Truthful Online Scheduling of Cloud Workloads under Uncertainty.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Incentivizing Combinatorial Bandit Exploration.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Exploration and Incentives in Reinforcement Learning.
CoRR, 2021

Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Bandits with Knapsacks beyond the Worst Case.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Adaptive Discretization for Adversarial Lipschitz Bandits.
Proceedings of the Conference on Learning Theory, 2021

Corruption-robust exploration in episodic reinforcement learning.
Proceedings of the Conference on Learning Theory, 2021

Sayer: Using Implicit Feedback to Optimize System Policies.
Proceedings of the SoCC '21: ACM Symposium on Cloud Computing, 2021

2020
Multidimensional Dynamic Pricing for Welfare Maximization.
ACM Trans. Economics and Comput., 2020

Book announcement: Introduction to Multi-Armed Bandits.
SIGecom Exch., 2020

Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting.
J. Mach. Learn. Res., 2020

Bayesian Incentive-Compatible Bandit Exploration.
Oper. Res., 2020

Competing Bandits: The Perils of Exploration Under Competition.
CoRR, 2020

Adaptive Discretization for Adversarial Bandits with Continuous Action Spaces.
CoRR, 2020

Sample Complexity of Incentivized Exploration.
CoRR, 2020

Advances in Bandits with Knapsacks.
CoRR, 2020

Incentivizing Exploration with Selective Data Disclosure.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Efficient Contextual Bandits with Continuous Actions.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Constrained episodic reinforcement learning in concave-convex and knapsack settings.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Bandits and Experts in Metric Spaces.
J. ACM, 2019

Introduction to Multi-Armed Bandits.
Found. Trends Mach. Learn., 2019

Competing Bandits: The Perils of Exploration under Competition.
CoRR, 2019

Bayesian Exploration with Heterogeneous Agents.
Proceedings of the World Wide Web Conference, 2019

The Perils of Exploration under Competition: A Computational Modeling Approach.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Bandits with Knapsacks.
J. ACM, 2018

Incentivizing Exploration with Unbiased Histories.
CoRR, 2018

Competing Bandits: Learning Under Competition.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

The Externalities of Exploration and How Data Diversity Helps Exploitation.
Proceedings of the Conference On Learning Theory, 2018

Combinatorial Semi-Bandits with Knapsacks.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Incentivizing exploration via information asymmetry.
XRDS, 2017

Semi-Bandits with Knapsacks.
CoRR, 2017

A Polynomial Time Algorithm for Spatio-Temporal Security Games.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Harvesting Randomness to Optimize Distributed Systems.
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, Palo Alto, CA, USA, 2017

2016
Selection and influence in cultural dynamics.
Netw. Sci., 2016

Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems.
J. Artif. Intell. Res., 2016

A Multiworld Testing Decision Service.
CoRR, 2016

How Many Workers to Ask?: Adaptive Exploration for Collecting High Quality Labels.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

2015
Dynamic Pricing with Limited Supply.
ACM Trans. Economics and Comput., 2015

Incentivizing high quality crowdwork.
SIGecom Exch., 2015

Low-Distortion Inference of Latent Similarities from a Multiplex Social Network.
SIAM J. Comput., 2015

Truthful Mechanisms with Implicit Payment Computation.
J. ACM, 2015

Contextual Dueling Bandits.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Characterizing Truthful Multi-armed Bandit Mechanisms.
SIAM J. Comput., 2014

One Practical Algorithm for Both Stochastic and Adversarial Bandits.
Proceedings of the 31th International Conference on Machine Learning, 2014

Using Worker Quality Scores to Improve Stopping Rules.
Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

Resourceful Contextual Bandits.
Proceedings of The 27th Conference on Learning Theory, 2014

Robust Multi-objective Learning with Mentor Feedback.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Online decision making in crowdsourcing markets: theoretical challenges.
SIGecom Exch., 2013

Ranked bandits in metric spaces: learning diverse rankings over large document collections.
J. Mach. Learn. Res., 2013

Online Decision Making in Crowdsourcing Markets: Theoretical Challenges (Position Paper).
CoRR, 2013

Dynamic Ad Allocation: Bandits with Budgets.
CoRR, 2013

Multi-parameter mechanisms with implicit payment computation.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem.
Proceedings of the COLT 2013, 2013

2012
The Best of Both Worlds: Stochastic and Adversarial Bandits.
Proceedings of the COLT 2012, 2012

2011
Monotone multi-armed bandit allocations.
Proceedings of the COLT 2011, 2011

Contextual Bandits with Similarity Information.
Proceedings of the COLT 2011, 2011

Multi-armed bandits on implicit metric spaces.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs.
SIAM J. Discret. Math., 2010

Sharp Dichotomies for Regret Minimization in Metric Spaces.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Learning optimally diverse rankings over large document collections.
Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

2009
Metric Embeddings with Relaxed Guarantees.
SIAM J. Comput., 2009

Triangulation and embedding using small sets of beacons.
J. ACM, 2009

Interleaving schemes on circulant graphs with two offsets.
Discret. Math., 2009

Characterizing truthful multi-armed bandit mechanisms: extended abstract.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Adapting to the Shifting Intent of Search Queries.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

2008
Network Failure Detection and Graph Connectivity.
SIAM J. Comput., 2008

Multi-armed bandits in metric spaces.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Adapting to a Changing Environment: the Brownian Restless Bandits.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
Distance estimation and object location via rings of neighbors.
Distributed Comput., 2007

Towards fast decentralized construction of locality-aware overlay networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Embedding, Distance Estimation and Object Location in Networks.
PhD thesis, 2006

Oscillations with TCP-Like Flow Control in Networks of Queues.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005
Distributed approaches to triangulation and embedding.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Meridian: a lightweight network location service without virtual coordinates.
Proceedings of the ACM SIGCOMM 2005 Conference on Applications, 2005

Metric Embeddings with Relaxed Guarantees.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005


  Loading...