|
ABSTRACT
Many multi-agent settings require that agents identify appropriate partners or teammates with whom to work on tasks. When selecting potential partners, agents may benefit from obtaining information about alternative possibilities through gossip (i.e., by consulting others) or using a reputation system (a centralized repository of information about past behavior). This paper defines a statistical model, the "Information-Acquisition Source Utility model" (IASU) by which agents operating in an uncertain world can determine the amount of information to collect about potential partners before choosing one and which information sources they should consult (gossip, reputation system, or additional personal interaction with the agent). The IASU model explicitly represents the cost of information, which may vary by information source. To maximize the expected gain from a choice, it estimates the utility of choosing a partner by iteratively estimating the benefit of additional information. The paper reports empirical studies that compare the effectiveness of the IASU model with a baseline in which only prior experience with a potential partner is used as the basis of the decision and with a model that determines in advance both the amount of information and its allocation among the different sources. Two different application domains are used in these empirical studies, the Surrogate Venture Game model, which concerns choosing an optimal partner for a business venture, and a restaurant domain. The results of the experiments show that the use of the model significantly increases the agents' overall utility.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
V. Cicirello and S. Smith. The max k-armed bandit: A new model for exploration applied to search heuristic selection. In AAAI-05, July 2005. Best Paper Award.
|
| |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
T. D. Huynh, N. Jennings, and N. Shadbolt. Fire: An integrated trust and reputation model for open multi-agent systems. Proceeding of 16th European Conference on Artificial Intelligence, pages 18--22, 2004.
|
| |
12
|
|
| |
13
|
J. Nelder and R. Mead. A simplex method for function minimization. The Computer Journal, 7:308--313, 1964.
|
 |
14
|
|
| |
15
|
S. D. Ramchurn, C. Sierra, L. Godo, and N. Jennings. A computational trust model for multi-agent interactions based on confidence and reputation. Proceedings of 6th International Workshop of Deception, Fraud and Trust in Agent Societies, pages 69--75, 2003.
|
 |
16
|
|
| |
17
|
B. Selman, H. A. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In the 2nd DIMACS Challenge on Cliques, Coloring and Satis., 1993.
|
| |
18
|
M. J. Streeter and S. Smith. An asymptotically optimal algorithm for the max k-armed bandit problem. In AAAI-06, July 2006.
|
| |
19
|
S. Talman, R. Toester, and S. Kraus. Choosing between heuristics and strategies: an enhanced model for decision-making. In Proceedings of the International Joint Conference of Artificial Intelligence, pages 324--330, 2005.
|
 |
20
|
|
| |
21
|
M. M. Vanzin and K. S. Barber. Decentralized partner finding in multi-agent systems. In Coordination of Large-Scale Multiagent Systems, pages 75--98. Springer, March 2006.
|
| |
22
|
G. Zacharia and P. Maes. Trust through reputation mechansims. Applied Artificial Intelligence, 14:881--907, 2000.
|
CITED BY
|
|
Martin Rehak , Eugen Staab , Michal Pechoucek , Jan Stiborek , Martin Grill , Karel Bartos, Dynamic information source selection for intrusion detection systems, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, May 10-15, 2009, Budapest, Hungary
|
|