Shipra Agrawal

Wei Tang

CoRR, 2024

2023

Optimistic Posterior Sampling for Reinforcement Learning: Worst-Case Regret Bounds.

[BibT_eX]

[DOI]

Randy Jia

Math. Oper. Res., February, 2023

Dynamic Pricing and Learning with Bayesian Persuasion.

[BibT_eX]

[DOI]

Yiding Feng

Wei Tang

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Learning in Structured MDPs with Convex Cost Functions: Improved Regret Bounds for Inventory Management.

[BibT_eX]

[DOI]

Randy Jia

Oper. Res., 2022

Online Allocation and Learning in the Presence of Strategic Agents.

[BibT_eX]

[DOI]

Steven Yin

Assaf Zeevi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Scale-Free Adversarial Multi Armed Bandits.

[BibT_eX]

[DOI]

Sudeep Raja Putta

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

Dynamic Pricing and Learning under the Bass Model.

[BibT_eX]

[DOI]

Steven Yin

Assaf Zeevi

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

Robust Repeated First Price Auctions.

[BibT_eX]

[DOI]

Eric Balkanski

Balasubramanian Sivan

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

2020

On Optimal Ordering in the Optimal Stopping Problem.

[BibT_eX]

[DOI]

Jay Sethuraman

Xingyu Zhang

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Reinforcement Learning for Integer Programming: Learning to Cut.

[BibT_eX]

[DOI]

Yuri Faenza

Proceedings of the 37th International Conference on Machine Learning, 2020

Discretizing Continuous Action Space for On-Policy Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Bandits with Global Convex Constraints and Objective.

[BibT_eX]

[DOI]

Oper. Res., 2019

MNL-Bandit: A Dynamic Learning Approach to Assortment Selection.

[BibT_eX]

[DOI]

Oper. Res., 2019

Dynamic First Price Auctions Robust to Heterogeneous Buyers.

[BibT_eX]

[DOI]

Eric Balkanski

Balasubramanian Sivan

CoRR, 2019

Submodular Secretary Problem with Shortlists.

[BibT_eX]

[DOI]

Mohammad Shadravan

Cliff Stein

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

2018

Boosting Trust Region Policy Optimization by Normalizing Flows Policy.

[BibT_eX]

[DOI]

CoRR, 2018

Implicit Policy for Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2018

Robust Repeated Auctions under Heterogeneous Buyer Behavior.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Balasubramanian Sivan

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

Exploration by Distributional Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Bandits with Delayed, Aggregated Anonymous Feedback.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy.

[BibT_eX]

[DOI]

Morteza Zadimoghaddam

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Near-Optimal Regret Bounds for Thompson Sampling.

[BibT_eX]

[DOI]

J. ACM, 2017

Bandits with Delayed Anonymous Feedback.

[BibT_eX]

[DOI]

CoRR, 2017

Posterior sampling for reinforcement learning: worst-case regret bounds.

[BibT_eX]

[DOI]

Randy Jia

CoRR, 2017

Thompson Sampling for the MNL-Bandit.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

2016

A Near-Optimal Exploration-Exploitation Approach for Assortment Selection.

[BibT_eX]

[DOI]

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

Linear Contextual Bandits with Knapsacks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives.

[BibT_eX]

[DOI]

Lihong Li

Proceedings of the 29th Conference on Learning Theory, 2016

2015

Contextual Bandits with Global Constraints and Objective.

[BibT_eX]

[DOI]

Lihong Li

CoRR, 2015

Linear Contextual Bandits with Global Constraints and Objective.

[BibT_eX]

[DOI]

CoRR, 2015

Fast Algorithms for Online Stochastic Convex Programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

A Dynamic Near-Optimal Algorithm for Online Linear Programming.

[BibT_eX]

[DOI]

Zizhuo Wang

Yinyu Ye

Oper. Res., 2014

Bandits with concave rewards and convex knapsacks.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

Spectral Thompson Sampling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Thompson Sampling for Contextual Bandits with Linear Payoffs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Machine Learning, 2013

Further Optimal Regret Bounds for Thompson Sampling.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

2012

Analysis of Thompson Sampling for the Multi-armed Bandit Problem.

[BibT_eX]

[DOI]

Proceedings of the COLT 2012, 2012

Price of Correlations in Stochastic Optimization.

[BibT_eX]

[DOI]

Oper. Res., 2012

2011

Optimization under uncertainty: bounding the correlation gap.

[BibT_eX]

[DOI]

PhD thesis, 2011

A Unified Framework for Dynamic Prediction Market Design.

[BibT_eX]

[DOI]

Oper. Res., 2011

2010

Correlation Robust Stochastic Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

FRAPP: a framework for high-accuracy privacy-preserving mining.

[BibT_eX]

[DOI]

B. Aditya Prakash

Data Min. Knowl. Discov., 2009

Distributionally Robust Stochastic Programming with Binary Random Variables

[BibT_eX]

[DOI]

CoRR, 2009

A unified framework for dynamic pari-mutuel information market design.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

2008

Stochastic Combinatorial Optimization under Probabilistic Constraints

[BibT_eX]

[DOI]

Amin Saberi

Yinyu Ye

CoRR, 2008

Parimutuel Betting on Permutations.

[BibT_eX]

[DOI]

Zizhuo Wang

Yinyu Ye

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007

Monitoring infrastructure for converged networks and services.

[BibT_eX]

[DOI]

C. N. Kanthi

K. V. M. Naidu

Jeyashankher Ramamirtham

Rajeev Rastogi

Scott Satkin

Anand Srinivasan

Bell Labs Tech. J., 2007

Diagnosing Link-Level Anomalies Using Passive Probes.

[BibT_eX]

[DOI]

K. V. M. Naidu

Rajeev Rastogi

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Efficient Detection of Distributed Constraint Violations.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

2006

VoIP service quality monitoring using active and passive probes.

[BibT_eX]

[DOI]

P. P. S. Narayan

Jeyashankher Ramamirtham

Proceedings of the First International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2006), 2006

2005

A Framework for High-Accuracy Privacy-Preserving Mining.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Data Engineering, 2005

2004

On Addressing Efficiency Concerns in Privacy-Preserving Mining.

[BibT_eX]

[DOI]

Vijay Krishnan

Proceedings of the Database Systems for Advances Applications, 2004

2003

On Addressing Efficiency Concerns in Privacy Preserving Data Mining

[BibT_eX]

[DOI]

Vijay Krishnan