Efficiently gathering information in costly domains

  • Authors:

  • Shulamit Reches;Ya'Akov (Kobi) Gal;Sarit Kraus

  • Affiliations:

  • Department of Applied Mathematics, Jerusalem College of Technology, Israel;Department of Information Systems Engineering, Ben-Gurion University of the Negev, Israel;Computer Science Department, Bar Ilan University, Israel

  • Venue:
  • Decision Support Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.