When to Make and Break Commitments?
Alihan Hüyük, Zhaozhi Qian, Mihaela van der Schaar
Abstract
In many scenarios, decision-makers must commit to long-term actions until their resolution before receiving the payoff of said actions, and usually, staying committed to such actions incurs continual costs. For instance, in healthcare, a newlydiscovered treatment cannot be marketed to patients until a clinical trial is conducted, which both requires time and is also costly. Of course in such scenarios, not all commitments eventually pay off. For instance, a clinical trial might end up failing to show efficacy. Given the time pressure created by the continual cost of keeping a commitment, we aim to answer: When should a decision-maker break a commitment that is likely to fail-either to make an alternative commitment or to make no further commitments at all? First, we formulate this question as a new type of optimal stopping/switching problem called the optimal commitment problem (OCP). Then, we theoretically analyze OCP, and based on the insight we gain, propose a practical algorithm for solving it. Finally, we empirically evaluate the performance of our algorithm in running clinical trials with subpopulation selection.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Active Observing in Continuous-time ControlSamuel Holt, Alihan Hüyük, Mihaela van der SchaarNeurIPS 2023 · 12 citations
- Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and SolutionsAlicia Curth, Alihan Hüyük, Mihaela van der SchaarICML 2023 · 3 citations
Builds on2
Related papers
- Computing Quantal Stackelberg Equilibrium in Extensive-Form GamesJakub Cerný, Viliam Lisý, Branislav Bosanský, Bo AnAAAI 2021 · 7 citations
- The Cost of Commitment in Option-Based Hierarchical RLRandy Lefebvre, Audrey DurandICML 2026
- Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity AlgorithmsQining Zhang, Lei YingNeurIPS 2023 · 10 citations
- Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft ConstraintsMartino Bernasconi, Federico Cacciamani, Matteo Castiglioni, Alberto Marchesi et al.ICML 2022 · 10 citations
- Learning Optimal Contracts: How to Exploit Small Action SpacesFrancesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola GattiICLR 2024 · 21 citations
