Economically Inspired Self-healing Model for Multi-Agent Systems

Self-healing in fault tolerant multi-agent systems is the system ability to automatically detect, diagnose, and repair the faults. However, most of the available solutions are fragile in incomplete, uncertain, and dynamic situations. This paper proposes a novel economically inspired self-healing model for fault tolerant Multi-Agent Systems where the agents are self-interested autonomic elements collaborate to achieve fault tolerance as a given high-level objective of the system. It is an effective solution for dynamic situations with a high possibility of uncertainty. The proposed model is in fact toward responding the challenge of negotiation theory for autonomic systems introduced by IBM. In particular, it is an inspiration of general explanation of Communism, Socialism, and Capitalism. Extensive experiments illustrate the effectiveness of the proposed social approach in comparison to the cases of no help situation, using purely redundant components, and helping without using a social value.

[1]  Takayuki Ito,et al.  Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[2]  David C. Parkes,et al.  ICE: an iterative combinatorial exchange , 2005, EC '05.

[3]  Jim Dowling,et al.  The Decentralised Coordination of Self-Adaptive Components for Autonomic Distributed Systems , 2005 .

[4]  P. Samuelson,et al.  Foundations of Economic Analysis. , 1948 .

[5]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[6]  David Levine,et al.  CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..

[7]  Torsten Eymann,et al.  Integration of Computational Models Inspired by Economics and Genetics , 2000 .

[8]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[9]  Chaitanya Swamy,et al.  Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity , 2007, EC '07.

[10]  M.S. Mirian,et al.  A distributed deterministic help scheme to improve the system fault tolerance , 2004, Proceedings World Automation Congress, 2004..

[11]  Jeffrey O. Kephart,et al.  The Vision of Autonomic Computing , 2003, Computer.

[12]  Takayuki Ito,et al.  Toward a Large Scale E-Market: A Greedy and Local Search Based Winner Determination , 2007, IEA/AIE.

[13]  Leigh Tesfatsion,et al.  Agent-Based Computational Economics: Growing Economies From the Bottom Up , 2002, Artificial Life.

[14]  Chaitanya Swamy,et al.  Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[15]  Chunyan Miao,et al.  Toward a Society Oriented Approach for Fault Handling in Multi-Agent Systems , 2007, 2007 Canadian Conference on Electrical and Computer Engineering.

[16]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[17]  Yoav Shoham,et al.  Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.

[18]  Shahar Dobzinski,et al.  An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.

[19]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

[20]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[21]  Ladan Tahvildari,et al.  A Quality-Driven Approach to Enable Decision-Making in Self-Adaptive Software , 2007, 29th International Conference on Software Engineering (ICSE'07 Companion).

[22]  Andrzej M. Goscinski,et al.  Building Autonomic Clusters: A Response to IBM's Autonomic Computing Challenge , 2003, PPAM.

[23]  Michael Schwind,et al.  A Trust-based Negotiation Mechanism for Decentralized Economic Scheduling , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[24]  Takayuki Ito,et al.  Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms , 2007, DEECS '07.

[25]  Noam Nisan,et al.  An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.

[26]  Yi Zhu,et al.  A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.