Jon Schneider

Orcid: 0000-0001-5392-3560

According to our database1, Jon Schneider authored at least 63 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bernoulli Factories for Flow-Based Polytopes.
SIAM J. Discret. Math., March, 2024

Auto-bidding and Auctions in Online Advertising: A Survey.
CoRR, 2024

Dynamical Analysis of Autobidding Systems.
CoRR, 2024

Rate-Preserving Reductions for Blackwell Approachability.
CoRR, 2024

Pareto-Optimal Algorithms for Learning in Games.
CoRR, 2024

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions.
CoRR, 2024

Contracting with a Learning Agent.
CoRR, 2024

Prior-Free Mechanism with Welfare Guarantees.
Proceedings of the ACM on Web Conference 2024, 2024

Online Learning with Bounded Recall.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Adversarial Online Learning with Temporal Feedback Graphs.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Contextual Bandits with Cross-Learning.
Math. Oper. Res., August, 2023

Learning Product Rankings Robust to Fake Users.
Oper. Res., July, 2023

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals.
CoRR, 2023

Bayesian Conversations.
CoRR, 2023

U-Calibration: Forecasting for an Unknown Agent.
CoRR, 2023

Eligibility Mechanisms: Auctions Meet Information Retrieval.
Proceedings of the ACM Web Conference 2023, 2023

The Power of Menus in Contract Design.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Optimal cross-learning for contextual bandits with unknown context distributions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Is Learning in Games Good for the Learners?
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimal No-Regret Learning for One-Sided Lipschitz Functions.
Proceedings of the International Conference on Machine Learning, 2023

Tuning the Utility-Privacy Trade-Off in Trajectory Data.
Proceedings of the Proceedings 26th International Conference on Extending Database Technology, 2023

U-Calibration: Forecasting for an Unknown Agent.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Pseudonorm Approachability and Applications to Regret Minimization.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
Contextual Search via Intrinsic Volumes.
SIAM J. Comput., 2022

History-Restricted Online Learning.
CoRR, 2022

Multiparameter Bernoulli Factories.
CoRR, 2022

Anonymous Bandits for Multi-User Systems.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Explainable Predictive Decision Mining for Operational Support.
Proceedings of the Service-Oriented Computing - ICSOC 2022 Workshops - ASOCA, AI-PA, FMCIoT, WESOACS 2022, Sevilla, Spain, November 29, 2022

Mining Developer Expertise from Bug Tracking Systems using the Author-topic Model.
Proceedings of the 17th International Conference on Evaluation of Novel Approaches to Software Engineering, 2022

Evaluating Probabilistic Topic Models for Bug Triaging Tasks.
Proceedings of the Evaluation of Novel Approaches to Software Engineering, 2022

Strategizing against Learners in Bayesian Games.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Corruption-Robust Contextual Search through Density Updates.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Combinatorial Bernoulli factories: matchings, flows, and other polytopes.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Optimal Contextual Pricing and Extensions.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Variable Decomposition for Prophet Inequalities and Optimal Ordering.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Contracts under Moral Hazard and Adverse Selection.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Prior-free Dynamic Mechanism Design With Limited Liability.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Margin-Independent Online Multiclass Learning via Convex Geometry.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Contextual Recommendations and Low-Regret Cutting-Plane Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Jointly Learning Prices and Product Features.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Reserve Price Optimization for First Price Auctions in Display Advertising.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Reserve Price Optimization for First Price Auctions.
CoRR, 2020

Competing Optimally Against An Imperfect Prophet.
CoRR, 2020

Contextual Search for General Hypothesis Classes.
CoRR, 2020

Myersonian Regression.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Costly Zero Order Oracles.
Proceedings of the Conference on Learning Theory, 2020

2019
Space-bounded Church-Turing thesis and computational tractability of closed systems.
CoRR, 2019

Classification and Re-Identification of Fruit Fly Individuals Across Days With Convolutional Neural Networks.
Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2019

Prior-Free Dynamic Auctions with Low Regret Buyers.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Strategizing against No-regret Learners.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

The Space Complexity of Mirror Games.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Multi-armed Bandit Problems with Strategic Arms.
Proceedings of the Conference on Learning Theory, 2019

2018
Learning Algorithms in Strategic Environments
PhD thesis, 2018

Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem.
IEEE Trans. Inf. Theory, 2018

Selling to a No-Regret Buyer.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Contextual Pricing for Lipschitz Buyers.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Competitive analysis of the top-<i>K</i> ranking problem.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Condorcet-Consistent and Approximately Strategyproof Tournament Rules.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Competitive analysis of the top-K ranking problem.
CoRR, 2016

2015
Information complexity is computable.
Electron. Colloquium Comput. Complex., 2015

Tight space-noise tradeoffs in computing the ergodic measure.
CoRR, 2015

2014
Fast Dynamic Pointer Following via Link-Cut Trees.
CoRR, 2014

Polynomial Sequences of Binomial-Type Arising in Graph Theory.
Electron. J. Comb., 2014


  Loading...