# Aleksandrs Slivkins

According to our database

Collaborative distances:

^{1}, Aleksandrs Slivkins authored at least 48 papers between 2003 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

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.

ACM Crossroads, 2017

Multidimensional Dynamic Pricing for Welfare Maximization.

Proceedings of the 2017 ACM Conference on Economics and Computation, 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

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

Bayesian Exploration: Incentivizing Exploration in Bayesian Games.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015

Incentivizing High Quality Crowdwork.

Proceedings of the 24th International Conference on World Wide Web, 2015

Bayesian Incentive-Compatible Bandit Exploration.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Contextual Dueling Bandits.

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Characterizing Truthful Multi-armed Bandit Mechanisms.

SIAM J. Comput., 2014

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

Proceedings of the ACM Conference on Economics and Computation, 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 Exchanges, 2013

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

Journal of Machine Learning Research, 2013

Low-distortion Inference of Latent Similarities from a Multiplex Social Network.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Selection and influence in cultural dynamics.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Multi-parameter mechanisms with implicit payment computation.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Bandits with Knapsacks.

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 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

Dynamic pricing with limited supply.

Proceedings of the 13th ACM Conference on Electronic Commerce, 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

Sharp Dichotomies for Regret Minimization in Metric Spaces.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Truthful mechanisms with implicit payment computation.

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 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

Interleaving schemes on circulant graphs with two offsets.

Discrete Mathematics, 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

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

Towards fast decentralized construction of locality-aware overlay networks.

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

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

Distance estimation and object location via rings of neighbors.

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Metric Embeddings with Relaxed Guarantees.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Network failure detection and graph connectivity.

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Triangulation and Embedding Using Small Sets of Beacons.

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

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

Proceedings of the Algorithms, 2003