TY - JOUR AU - Reches, Shulamit AU - Kalech, Meir AU - Stern, Rami PY - 2011/08/04 Y2 - 2024/03/28 TI - When to Stop? That Is the Question JF - Proceedings of the AAAI Conference on Artificial Intelligence JA - AAAI VL - 25 IS - 1 SE - Reasoning Under Uncertainty DO - 10.1609/aaai.v25i1.8020 UR - https://ojs.aaai.org/index.php/AAAI/article/view/8020 SP - 1063-1068 AB - <p> When to make a decision is a key question in decision making problems characterized by uncertainty. In this paper we deal with decision making in environments where the information arrives dynamically. We address the tradeoff between waiting and stopping strategies. On the one hand, waiting to obtain more information reduces the uncertainty, but it comes with a cost. On the other hand, stopping and making a decision based on an expected utility, decreases the cost of waiting, but the decision is made based on uncertain information. In this paper, we prove that computing the optimal time to make a decision that guarantees the optimal utility is NP-hard. We propose a pessimistic approximation that guarantees an optimal decision when the recommendation is to wait. We empirically evaluate our algorithm and show that the quality of the decision is near-optimal and much faster than the optimal algorithm. </p> ER -