Choosing a Candidate Using Efficient Allocation of Biased Information

• Published in: ACM transactions on intelligent systems and technology 2015-01, Vol.5 (4), p.1-30
• Main Authors: Reches, Shulamit, Kalech, Meir
• Format: Article
• Language: English
• ISSN: 2157-6904; 2157-6912
• DOI: 10.1145/2558327

This article deals with a decision-making problem concerning an agent who wants to choose a partner from multiple candidates for long-term collaboration. To choose the best partner, the agent can rely on prior information he knows about the candidates. However, to improve his decision, he can request additional information from information sources. Nonetheless, acquiring information from external information sources about candidates may be biased due to different personalities of the agent searching for a partner and the information source. In addition, information may be costly. Considering the bias and the cost of the information sources, the optimization problem addressed in this article is threefold: (1) determining the necessary amount of additional information, (2) selecting information sources from which to request the information, and (3) choosing the candidates on whom to request the additional information. We propose a heuristic to solve this optimization problem. The results of experiments on simulated and real-world domains demonstrate the efficiency of our algorithm.