Aleksandrs Slivkins
Aleksandrs Slivkins
Microsoft Research New York
Verified email at - Homepage
TitleCited byYear
Meridian: A lightweight network location service without virtual coordinates
B Wong, A Slivkins, EG Sirer
ACM SIGCOMM Computer Communication Review 35 (4), 85-96, 2005
Multi-armed bandits in metric spaces
R Kleinberg, A Slivkins, E Upfal
Proceedings of the fortieth annual ACM symposium on Theory of computing, 681-690, 2008
Contextual bandits with similarity information
A Slivkins
The Journal of Machine Learning Research 15 (1), 2533-2568, 2014
Triangulation and embedding using small sets of beacons
J Kleinberg, A Slivkins, T Wexler
Journal of the ACM (JACM) 56 (6), 32, 2009
Bandits with knapsacks
A Badanidiyuru, R Kleinberg, A Slivkins
Journal of the ACM (JACM) 65 (3), 13, 2018
Characterizing truthful multi-armed bandit mechanisms
M Babaioff, Y Sharma, A Slivkins
SIAM Journal on Computing 43 (1), 194-230, 2014
Distance estimation and object location via rings of neighbors
A Slivkins
Distributed Computing 19 (4), 313-333, 2007
Ranked bandits in metric spaces: learning diverse rankings over large document collections
A Slivkins, F Radlinski, S Gollapudi
Journal of Machine Learning Research 14 (Feb), 399-436, 2013
Dynamic pricing with limited supply
M Babaioff, S Dughmi, R Kleinberg, A Slivkins
ACM Transactions on Economics and Computation (TEAC) 3 (1), 4, 2015
The best of both worlds: stochastic and adversarial bandits
S Bubeck, A Slivkins
Conference on Learning Theory, 42.1-42.23, 2012
The Best of Both Worlds: Stochastic and Adversarial Bandits
S Bubeck, A Slivkins
Truthful mechanisms with implicit payment computation
M Babaioff, RD Kleinberg, A Slivkins
Journal of the ACM (JACM) 62 (2), 10, 2015
Metric embeddings with relaxed guarantees
THH Chan, K Dhamdhere, A Gupta, J Kleinberg, A Slivkins
SIAM Journal on Computing 38 (6), 2303-2329, 2009
Incentivizing high quality crowdwork
CJ Ho, A Slivkins, S Suri, JW Vaughan
Proceedings of the 24th International Conference on World Wide Web, 419-429, 2015
Adapting to a Changing Environment: the Brownian Restless Bandits.
A Slivkins, E Upfal
COLT, 343-354, 2008
Network failure detection and graph connectivity
J Kleinberg, M Sandler, A Slivkins
SIAM Journal on Computing 38 (4), 1330-1346, 2008
Parameterized tractability of edge-disjoint paths on directed acyclic graphs
A Slivkins
SIAM Journal on Discrete Mathematics 24 (1), 146-157, 2010
One Practical Algorithm for Both Stochastic and Adversarial Bandits.
Y Seldin, A Slivkins
ICML, 1287-1295, 2014
Online decision making in crowdsourcing markets: Theoretical challenges
A Slivkins, JW Vaughan
ACM SIGecom Exchanges 12 (2), 4-23, 2013
Adaptive crowdsourcing algorithms for the bandit survey problem
I Abraham, O Alonso, V Kandylas, A Slivkins
Conference on learning theory, 882-910, 2013
The system can't perform the operation now. Try again later.
Articles 1–20