activity
20192026
most citedFair Exploration via Axiomatic Bargaining

9 citations · 14 across the 8 of their papers we have counts for

collaborators

8 papers

cs.AI2026

LLMs Can Design Near-Optimal OR Algorithms

Jackie Baek

We ask whether large language models (LLMs) can design effective algorithms for well-specified operations research (OR) problems. We study inventory control, queueing network contr…

cs.GT2026

Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices

Jackie Baek, Vivek F. Farias, Farrell Wu

We study whether simple algorithmic pricing systems can systematically produce collusive-like prices in multi-firm markets. We consider firms that price using a myopic estimate-the…

cs.DS2023

Leveraging Reusability: Improved Competitive Ratio of Greedy for Reusable Resources

Jackie Baek, Shixin Wang

We study online weighted bipartite matching of reusable resources where an adversarial sequence of requests for resources arrive over time. A resource that is matched is 'used' for…

cs.LG2023★ 1 cited

Policy Optimization for Personalized Interventions in Behavioral Health

Jackie Baek, Justin J. Boutilier, Vivek F. Farias +2

Behavioral health interventions, delivered through digital platforms, have the potential to significantly improve health outcomes, through education, motivation, reminders, and out…

cs.LG2021★ 9 cited

Fair Exploration via Axiomatic Bargaining

Jackie Baek, Vivek F. Farias

Exploration is often necessary in online learning to maximize long-term reward, but it comes at the cost of short-term 'regret'. We study how this cost of exploration is shared acr…

stat.ME2020

The Limits to Learning a Diffusion Model

Jackie Baek, Vivek F. Farias, Andreea Georgescu +5

This paper provides the first sample complexity lower bounds for the estimation of simple diffusion models, including the Bass model (used in modeling consumer adoption) and the SI…

cs.LG2020★ 2 cited

TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation

Jackie Baek, Vivek F. Farias

Thompson sampling has become a ubiquitous approach to online decision problems with bandit feedback. The key algorithmic task for Thompson sampling is drawing a sample from the pos…

cs.DS2019★ 2 cited

Prophet Inequalities on the Intersection of a Matroid and a Graph

Jackie Baek, Will Ma

We consider prophet inequalities in a setting where agents correspond to both elements in a matroid and vertices in a graph. A set of agents is feasible if they form both an indepe…