Competitive analysis of the top-K ranking problem X Chen, S Gopi, J Mao, J Schneider
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
37 2017 Selling to a no-regret buyer M Braverman, J Mao, J Schneider, M Weinberg
Proceedings of the 2018 ACM Conference on Economics and Computation, 523-538, 2018
33 2018 Contextual search via intrinsic volumes RP Leme, J Schneider
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
31 2018 Contextual pricing for lipschitz buyers J Mao, R Leme, J Schneider
Advances in Neural Information Processing Systems 31, 2018
31 2018 Contextual bandits with cross-learning S Balseiro, N Golrezaei, M Mahdian, V Mirrokni, J Schneider
Advances in Neural Information Processing Systems 32, 2019
21 2019 Multi-armed bandit problems with strategic arms M Braverman, J Mao, J Schneider, SM Weinberg
Conference on Learning Theory, 383-416, 2019
19 2019 Information complexity is computable M Braverman, J Schneider
arXiv preprint arXiv:1502.02971, 2015
15 2015 Strategizing against no-regret learners Y Deng, J Schneider, B Sivan
Advances in neural information processing systems 32, 2019
14 2019 Learning product rankings robust to fake users N Golrezaei, V Manshadi, J Schneider, S Sekar
Proceedings of the 22nd ACM Conference on Economics and Computation, 560-561, 2021
11 2021 Prior-free dynamic auctions with low regret buyers Y Deng, J Schneider, B Sivan
Advances in Neural Information Processing Systems 32, 2019
11 2019 Optimal contextual pricing and extensions A Liu, RP Leme, J Schneider
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
10 2021 Condorcet-consistent and approximately strategyproof tournament rules J Schneider, A Schvartzman, SM Weinberg
arXiv preprint arXiv:1605.09733, 2016
8 2016 Space-bounded Church-Turing thesis and computational tractability of closed systems M Braverman, J Schneider, C Rojas
Physical review letters 115 (9), 098701, 2015
8 2015 Contracts under moral hazard and adverse selection G Guruganesh, J Schneider, JR Wang
Proceedings of the 22nd ACM Conference on Economics and Computation, 563-582, 2021
6 2021 Variable decomposition for prophet inequalities and optimal ordering A Liu, RP Leme, M Pál, J Schneider, B Sivan
arXiv preprint arXiv:2004.10163, 2020
5 2020 The space complexity of mirror games S Garg, J Schneider
arXiv preprint arXiv:1710.02898, 2017
5 2017 Optimal Instance Adaptive Algorithm for the Top- Ranking Problem X Chen, S Gopi, J Mao, J Schneider
IEEE Transactions on Information Theory 64 (9), 6139-6160, 2018
4 2018 Tight space-noise tradeoffs in computing the ergodic measure M Braverman, C Rojas, J Schneider
Sbornik: Mathematics 208 (12), 1758, 2017
4 2017 Polynomial sequences of binomial-type arising in graph theory J Schneider
arXiv preprint arXiv:1206.6174, 2012
4 2012 Combinatorial Bernoulli factories: matchings, flows, and other polytopes R Niazadeh, RP Leme, J Schneider
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
3 2021