8 papers
Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents
Nika Haghtalab, Chara Podimata, Kunhe Yang
We introduce \emph{Calibrated Stackelberg Games (CSGs)}, a generalization of the standard Stackelberg Games (SGs) framework. In CSGs, a principal repeatedly interacts with an agent…
Online Scheduling for LLM Inference with KV Cache Constraints
Patrick Jaillet, Jiashuo Jiang, Konstantina Mellou +3
Large Language Model (LLM) inference, where a trained model generates text one word at a time in response to user prompts, is a computationally intensive process requiring efficien…
Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
Renato Paes Leme, Chara Podimata, Jon Schneider
We study the problem of contextual search, a generalization of binary search in higher dimensions, in the adversarial noise model. Let be the dimension of the problem, be t…
Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
Chara Podimata, Aleksandrs Slivkins
Lipschitz bandits is a prominent version of multi-armed bandits that studies large, structured action spaces such as the interval, where similar actions are guaranteed to h…
Grace Period is All You Need: Individual Fairness without Revenue Loss in Revenue Management
Patrick Jaillet, Chara Podimata, Zijie Zhou
Imagine you and a friend purchase identical items at a store, yet only your friend received a discount. Would your friend's discount make you feel unfairly treated by the store? An…
Incentivizing Desirable Effort Profiles in Strategic Classification: The Role of Causality and Uncertainty
Valia Efthymiou, Chara Podimata, Diptangshu Sen +1
We study strategic classification in binary decision-making settings where agents can modify their features in order to improve their classification outcomes. Importantly, our work…