TY - JOUR
T1 - Efficiently gathering information in costly domains
AU - Reches, Shulamit
AU - Gal, Ya'Akov
AU - Kraus, Sarit
N1 - Funding Information:
This work was supported in part by the Google Inter-university center for Electronic Markets and Auctions and Marie Curie reintegration grant 268362 .
Funding Information:
Kobi Gal (PhD, Harvard University, 2007) is a faculty member in the Department of Information Systems and Software Engineering at Ben-Gurion University and an associate of the School of Engineering and Applied Sciences at Harvard University. He has published over 30 papers in top conferences and journals focusing on human-computer decision-making in areas from negotiation to science education. Gal is the recipient of the EU's Marie Curie Reintegration Grant for 2010; a two-time recipient of Harvard University's Derek Bok award for excellence in teaching; and a recipient of the School of Engineering and Applied Science's outstanding teacher award. He has taught numerous courses on AI and cognitive science at Harvard and Ben-Gurion Universities.
PY - 2013/4/1
Y1 - 2013/4/1
N2 - This paper proposes a novel technique for allocating information gathering actions in settings where agents need to choose among several alternatives, each of which provides a stochastic outcome to the agent. Samples of these outcomes are available to agents prior to making decisions and obtaining further samples is associated with a cost. The paper formalizes the task of choosing the optimal sequence of information gathering actions in such settings and establishes it to be NP-Hard. It suggests a novel estimation technique for the optimal number of samples to obtain for each of the alternatives. The approach takes into account the trade-offs associated with using prior samples to choose the best alternative and paying to obtain additional samples. This technique is evaluated empirically in several different settings using real data. Results show that our approach was able to significantly outperform alternative algorithms from the literature for allocating information gathering actions in similar types of settings. These results demonstrate the efficacy of our approach as an efficient, tractable technique for deciding how to acquire information when agents make decisions under uncertain conditions.
AB - This paper proposes a novel technique for allocating information gathering actions in settings where agents need to choose among several alternatives, each of which provides a stochastic outcome to the agent. Samples of these outcomes are available to agents prior to making decisions and obtaining further samples is associated with a cost. The paper formalizes the task of choosing the optimal sequence of information gathering actions in such settings and establishes it to be NP-Hard. It suggests a novel estimation technique for the optimal number of samples to obtain for each of the alternatives. The approach takes into account the trade-offs associated with using prior samples to choose the best alternative and paying to obtain additional samples. This technique is evaluated empirically in several different settings using real data. Results show that our approach was able to significantly outperform alternative algorithms from the literature for allocating information gathering actions in similar types of settings. These results demonstrate the efficacy of our approach as an efficient, tractable technique for deciding how to acquire information when agents make decisions under uncertain conditions.
KW - Artificial intelligence
KW - Empirical analysis
KW - Incomplete information
KW - Value of information
UR - http://www.scopus.com/inward/record.url?scp=84877789622&partnerID=8YFLogxK
U2 - 10.1016/j.dss.2013.01.021
DO - 10.1016/j.dss.2013.01.021
M3 - Article
AN - SCOPUS:84877789622
SN - 0167-9236
VL - 55
SP - 326
EP - 335
JO - Decision Support Systems
JF - Decision Support Systems
IS - 1
ER -