关注
Jon Schneider
Jon Schneider
在 google.com 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
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
692018
Contextual pricing for lipschitz buyers
J Mao, R Leme, J Schneider
Advances in Neural Information Processing Systems 31, 2018
492018
Contextual search via intrinsic volumes
RP Leme, J Schneider
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
462018
Contextual bandits with cross-learning
S Balseiro, N Golrezaei, M Mahdian, V Mirrokni, J Schneider
Advances in Neural Information Processing Systems 32, 2019
452019
Strategizing against no-regret learners
Y Deng, J Schneider, B Sivan
Advances in neural information processing systems 32, 2019
442019
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
402021
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
402017
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
382021
Multi-armed bandit problems with strategic arms
M Braverman, J Mao, J Schneider, SM Weinberg
Conference on Learning Theory, 383-416, 2019
332019
Prior-free dynamic auctions with low regret buyers
Y Deng, J Schneider, B Sivan
Advances in Neural Information Processing Systems 32, 2019
272019
Optimal contextual pricing and extensions
A Liu, RP Leme, J Schneider
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
262021
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
252020
Strategizing against learners in bayesian games
Y Mansour, M Mohri, J Schneider, B Sivan
Conference on Learning Theory, 5221-5252, 2022
222022
Condorcet-consistent and approximately strategyproof tournament rules
J Schneider, A Schvartzman, SM Weinberg
arXiv preprint arXiv:1605.09733, 2016
162016
Information complexity is computable
M Braverman, J Schneider
arXiv preprint arXiv:1502.02971, 2015
162015
Space-bounded Church-Turing thesis and computational tractability of closed systems
M Braverman, J Schneider, C Rojas
Physical review letters 115 (9), 098701, 2015
142015
Optimal no-regret learning for one-sided lipschitz functions
P Dütting, G Guruganesh, J Schneider, JR Wang
International Conference on Machine Learning, 8836-8850, 2023
112023
U-calibration: Forecasting for an unknown agent
B Kleinberg, RP Leme, J Schneider, Y Teng
The Thirty Sixth Annual Conference on Learning Theory, 5143-5145, 2023
102023
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
102021
Contracting with a learning agent
G Guruganesh, Y Kolumbus, J Schneider, I Talgam-Cohen, ...
arXiv preprint arXiv:2401.16198, 2024
92024
系统目前无法执行此操作,请稍后再试。
文章 1–20