Decision making with dynamic uncertain events

Meir Kalech, Shulamit Reches

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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 information arrives dynamically. We address the tradeoff between waiting and stopping strategies. On the one hand, waiting to obtain more information reduces uncertainty, but it comes with a cost. Stopping and making a decision based on an expected utility reduces the cost of waiting, but the decision is based on uncertain information. We propose an optimal algorithm and two approximation algorithms. We prove that one approximation is optimistic - waits at least as long as the optimal algorithm, while the other is pessimistic - stops not later than the optimal algorithm. We evaluate our algorithms theoretically and empirically and show that the quality of the decision in both approximations is near-optimal and much faster than the optimal algorithm. Also, we can conclude from the experiments that the cost function is a key factor to chose the most effective algorithm.

Original languageEnglish
Pages (from-to)233-275
Number of pages43
JournalJournal of Artificial Intelligence Research
StatePublished - 1 Oct 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2015 AI Access Foundation. All rights reserved.


Dive into the research topics of 'Decision making with dynamic uncertain events'. Together they form a unique fingerprint.

Cite this