Jon Schneider

Eshwar Ram Arunachaleswaran

SIAM J. Discret. Math., March, 2024

Pareto-Optimal Algorithms for Learning in Games.

[BibT_eX]

[DOI]

Natalie Collina

CoRR, 2024

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

[BibT_eX]

[DOI]

Rachitesh Kumar

Emmanouil-Vasileios Vlatakis-Gkaragkounis

CoRR, 2024

Contracting with a Learning Agent.

[BibT_eX]

[DOI]

Joshua R. Wang

S. Matthew Weinberg

CoRR, 2024

2023

Contextual Bandits with Cross-Learning.

[BibT_eX]

[DOI]

Math. Oper. Res., August, 2023

Learning Product Rankings Robust to Fake Users.

[BibT_eX]

[DOI]

Oper. Res., July, 2023

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals.

[BibT_eX]

[DOI]

Hanrui Zhang

CoRR, 2023

Bayesian Conversations.

[BibT_eX]

[DOI]

Shuran Zheng

CoRR, 2023

U-Calibration: Forecasting for an Unknown Agent.

[BibT_eX]

[DOI]

CoRR, 2023

Eligibility Mechanisms: Auctions Meet Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

The Power of Menus in Contract Design.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Optimal cross-learning for contextual bandits with unknown context distributions.

[BibT_eX]

[DOI]

Julian Zimmert

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?

[BibT_eX]

[DOI]

William Brown

Kiran Vodrahalli

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.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Tuning the Utility-Privacy Trade-Off in Trajectory Data.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 26th International Conference on Extending Database Technology, 2023

U-Calibration: Forecasting for an Unknown Agent.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Pseudonorm Approachability and Applications to Regret Minimization.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022

Contextual Search via Intrinsic Volumes.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

History-Restricted Online Learning.

[BibT_eX]

[DOI]

Kiran Vodrahalli

CoRR, 2022

Multiparameter Bernoulli Factories.

[BibT_eX]

[DOI]

CoRR, 2022

Anonymous Bandits for Multi-User Systems.

[BibT_eX]

[DOI]

Hossein Esfandiari

Vahab Mirrokni

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.

[BibT_eX]

[DOI]

Wil M. P. van der Aalst

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.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Evaluation of Novel Approaches to Software Engineering, 2022

Evaluating Probabilistic Topic Models for Bug Triaging Tasks.

[BibT_eX]

[DOI]

Proceedings of the Evaluation of Novel Approaches to Software Engineering, 2022

Strategizing against Learners in Bayesian Games.

[BibT_eX]

[DOI]

Yishay Mansour

Mehryar Mohri

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Corruption-Robust Contextual Search through Density Updates.

[BibT_eX]

[DOI]

Chara Podimata

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Combinatorial Bernoulli factories: matchings, flows, and other polytopes.

[BibT_eX]

[DOI]

Rad Niazadeh

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Optimal Contextual Pricing and Extensions.

[BibT_eX]

[DOI]

Allen Liu

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Variable Decomposition for Prophet Inequalities and Optimal Ordering.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Contracts under Moral Hazard and Adverse Selection.

[BibT_eX]

[DOI]

Guru Guruganesh

Joshua R. Wang

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Prior-free Dynamic Mechanism Design With Limited Liability.

[BibT_eX]

[DOI]

S. Matthew Weinberg

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Margin-Independent Online Multiclass Learning via Convex Geometry.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ehsan Emamjomeh-Zadeh

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Reserve Price Optimization for First Price Auctions in Display Advertising.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Reserve Price Optimization for First Price Auctions.

[BibT_eX]

[DOI]

CoRR, 2020

Competing Optimally Against An Imperfect Prophet.

[BibT_eX]

[DOI]

CoRR, 2020

Contextual Search for General Hypothesis Classes.

[BibT_eX]

[DOI]

Allen Liu

CoRR, 2020

Myersonian Regression.

[BibT_eX]

[DOI]

Allen Liu

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

Costly Zero Order Oracles.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

2019

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

[BibT_eX]

[DOI]

Cristobal Rojas

Jonathan Schneider

CoRR, 2019

Classification and Re-Identification of Fruit Fly Individuals Across Days With Convolutional Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2019

Prior-Free Dynamic Auctions with Low Regret Buyers.

[BibT_eX]

[DOI]

Yuan Deng

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Strategizing against No-regret Learners.

[BibT_eX]

[DOI]

Yuan Deng

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.

[BibT_eX]

[DOI]

Sumegha Garg

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Multi-armed Bandit Problems with Strategic Arms.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

2018

Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Selling to a No-Regret Buyer.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Contextual Pricing for Lipschitz Buyers.

[BibT_eX]

[DOI]

Jieming Mao

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Condorcet-Consistent and Approximately Strategyproof Tournament Rules.

[BibT_eX]

[DOI]

Ariel Schvartzman

S. Matthew Weinberg

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Competitive analysis of the top-K ranking problem.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Information complexity is computable.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Tight space-noise tradeoffs in computing the ergodic measure.

[BibT_eX]

[DOI]

Cristobal Rojas

CoRR, 2015

2014

Fast Dynamic Pointer Following via Link-Cut Trees.

[BibT_eX]

[DOI]

Erik D. Demaine

Nathan Pinsker