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
50 2018 Contextual search via intrinsic volumes RP Leme, J Schneider
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
43 2018 Contextual pricing for lipschitz buyers J Mao, R Leme, J Schneider
Advances in Neural Information Processing Systems 31, 2018
43 2018 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
38 2017 Contextual bandits with cross-learning S Balseiro, N Golrezaei, M Mahdian, V Mirrokni, J Schneider
Advances in Neural Information Processing Systems 32, 2019
37 2019 Strategizing against no-regret learners Y Deng, J Schneider, B Sivan
Advances in neural information processing systems 32, 2019
30 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
29 2021 Multi-armed bandit problems with strategic arms M Braverman, J Mao, J Schneider, SM Weinberg
Conference on Learning Theory, 383-416, 2019
26 2019 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
24 2021 Optimal contextual pricing and extensions A Liu, RP Leme, J Schneider
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
23 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
19 2020 Prior-free dynamic auctions with low regret buyers Y Deng, J Schneider, B Sivan
Advances in Neural Information Processing Systems 32, 2019
19 2019 Information complexity is computable M Braverman, J Schneider
arXiv preprint arXiv:1502.02971, 2015
15 2015 Condorcet-consistent and approximately strategyproof tournament rules J Schneider, A Schvartzman, SM Weinberg
arXiv preprint arXiv:1605.09733, 2016
14 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
11 2015 A new approach to hazard analysis for rotorcraft B Abrecht, D Arterburn, D Horney, J Schneider, B Abe, N Leveson
American Helicopter Society International, 2016
9 2016 Strategizing against learners in bayesian games Y Mansour, M Mohri, J Schneider, B Sivan
Conference on Learning Theory, 5221-5252, 2022
7 2022 Reserve price optimization for first price auctions in display advertising Z Feng, S Lahaie, J Schneider, J Ye
International Conference on Machine Learning, 3230-3239, 2021
7 2021 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
7 2018 The space complexity of mirror games S Garg, J Schneider
arXiv preprint arXiv:1710.02898, 2017
7 2017