The Experts below are selected from a list of 3510 Experts worldwide ranked by ideXlab platform
Tang Nianqing - One of the best experts on this subject based on the ideXlab platform.
-
Malicious Agents search in Agent mediated electronic markets
Computer Science, 2008Co-Authors: Tang NianqingAbstract:This paper describes and discusses the Malicious Agent issues in the Agent-mediated electronic markets.We define the Malicious Agents as software Agents that have Malicious purpose.Malicious Agents can do harm in various ways,such as attacking normal Agents,disordering deals,cheating users,stealing intimate information,wasting resources,destroying the markets and so on.In our opinion,Malicious Agents are more harmful than the common PC viruses in some measure.We propose the SCAAM,and use some strotegies to show the SCAAM how to works.
Shi Jun - One of the best experts on this subject based on the ideXlab platform.
-
ma lma architecture for dealing with Malicious Agents in Agent mediated electronic markets
Lecture Notes in Computer Science, 2001Co-Authors: Ding Peng, Shi JunAbstract:This paper describes and discusses the Malicious Agent issues in the Agent-mediated electronic markets. We define the Malicious Agents as software Agents that have Malicious purpose. Malicious Agents can do harm in various ways, such as attacking normal Agents, disordering deals, cheating users, stealing intimate information, wasting resources, destroying the markets and so on. We compare the Malicious Agents with PC viruses in four aspects: originations, actions, means of propagation & infection and speed of propagation & infection. In our opinion, Malicious Agents are more harmful than the common PC viruses in some measure. We proposed the MA and LMA architecture to deal with the problem described above. Besides, some Agent transaction protocols are also presented to show how the MA and LMA architecture works. In the last of this paper, we give some implementation considerations as the foundation for further developments.
Ding Peng - One of the best experts on this subject based on the ideXlab platform.
-
ma lma architecture for dealing with Malicious Agents in Agent mediated electronic markets
Lecture Notes in Computer Science, 2001Co-Authors: Ding Peng, Shi JunAbstract:This paper describes and discusses the Malicious Agent issues in the Agent-mediated electronic markets. We define the Malicious Agents as software Agents that have Malicious purpose. Malicious Agents can do harm in various ways, such as attacking normal Agents, disordering deals, cheating users, stealing intimate information, wasting resources, destroying the markets and so on. We compare the Malicious Agents with PC viruses in four aspects: originations, actions, means of propagation & infection and speed of propagation & infection. In our opinion, Malicious Agents are more harmful than the common PC viruses in some measure. We proposed the MA and LMA architecture to deal with the problem described above. Besides, some Agent transaction protocols are also presented to show how the MA and LMA architecture works. In the last of this paper, we give some implementation considerations as the foundation for further developments.
Shreyas Sundaram - One of the best experts on this subject based on the ideXlab platform.
-
resilience for consensus based distributed algorithms in hostile environment
Allerton Conference on Communication Control and Computing, 2019Co-Authors: Xuan Wang, Shaoshuai Mou, Shreyas SundaramAbstract:Consensus-based distributed algorithms have been the key to many problems arising in multi-Agent systems including reinforcement learning [1], [2], formation control [3], [4], task allocation [5]and so on. Byconsensushere is meant that all Agents in the network reach an agreement regarding a certain quantity of interest [6], [7]. Bydistributedhere is meant that the whole multi-Agent system achieve global objectives by only local coordination among nearby neighbors [8]. On one hand, the absence of central controllers in multi-Agent systems make them inherently robust against individual Agent/link failures. On the other hand, the high dependence of the whole system on local coordination also raises a significant concern that algorithms for multi-Agent networks may be crashed down in the presence of even one Malicious Agent [9]. This has motivated us to develop methodologies to achieveresiliencein order to guarantee nice performance for consensus-based distributed algorithms especially in hostile environment. One challenge along this direction comes from the fact that each Agent is usually with locally available information, which makes it very difficult to identify or isolate Malicious Agents [10]. The authors of [11]–[13]have achieved significant progress by showing that given $N$adversarial nodes under Byzantine attacks, there exists a strategy for normal Agents to achieve consensus if the network connectivity is $2 N+1.$These results are usually computationally expensive, assume the network topology to be all-to-all networks, or require normal Agents to be aware of non-local information. Most recently the authors of [14], [15]have investigated consensus-based distributed optimizations under adversarial Agents. They have introduced a local filtering mechanism which allows each Agent to discard the most extreme values in their neighborhood at each step. This is not directly applicable to consensus-based distributed computation algorithms [16]–[19], in which extreme values may come from the local constraints instead of Malicious Agents. Thus in this talk we will present a new approach developed in [9], which achieves automated resilience without the identification of Malicious Agents for consensus-based distributed algorithms based on intersection of convex hulls [20].
Euripides Markou - One of the best experts on this subject based on the ideXlab platform.
-
mobile Agents rendezvous in spite of a Malicious Agent
Algorithmic Aspects of Wireless Sensor Networks, 2015Co-Authors: Shantanu Das, Flaminia L Luccio, Euripides MarkouAbstract:We examine the problem of rendezvous, i.e., having multiple mobile Agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a Malicious Agent that moves through the network and tries to block the honest Agents and prevents them from gathering. The Malicious Agent can be thought of as a mobile fault in the network. The Malicious Agent is assumed to be arbitrarily fast, has full knowledge of the network and it cannot be exterminated by the honest Agents. On the other hand, the honest Agents are assumed to be quite weak: They are asynchronous and anonymous, they have only finite memory, they have no prior knowledge of the network and they can communicate with the other Agents only when they meet at a node. Can the honest Agents achieve rendezvous starting from an arbitrary configuration in spite of the Malicious Agent? We present some necessary conditions for solving rendezvous in spite of the Malicious Agent in arbitrary networks. We then focus on the ring and mesh topologies and provide algorithms to solve rendezvous. For ring networks, our algorithms solve rendezvous in all feasible instances of the problem, while we show that rendezvous is impossible for an even number of Agents in unoriented rings. For the oriented mesh networks, we prove that the problem can be solved when the honest Agents initially form a connected configuration without holes if and only if they can see which are the occupied nodes within a two-hops distance. To the best of our knowledge, this is the first attempt to study such a powerful and mobile fault model, in the context of mobile Agents. Our model lies between the more powerful but static fault model of black holes which can even destroy the Agents, and the less powerful but mobile fault model of Byzantine Agents which can only imitate the honest Agents but can neither harm nor stop them.
-
mobile Agents rendezvous in spite of a Malicious Agent
arXiv: Distributed Parallel and Cluster Computing, 2014Co-Authors: Shantanu Das, Flaminia L Luccio, Euripides MarkouAbstract:We examine the problem of rendezvous, i.e., having multiple mobile Agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a Malicious Agent that moves through the network and tries to block the honest Agents and prevents them from gathering. The Malicious Agent is assumed to be arbitrarily fast, has full knowledge of the network and it cannot be exterminated by the honest Agents. On the other hand, the honest Agents are assumed to be quite weak: They are asynchronous and anonymous, they have only finite memory, they have no prior knowledge of the network and they can communicate with the other Agents only when they meet at a node. Can the honest Agents achieve rendezvous starting from an arbitrary configuration in spite of the Malicious Agent? We present some necessary conditions for solving rendezvous in spite of the Malicious Agent in arbitrary networks. We then focus on the ring and mesh topologies and provide algorithms to solve rendezvous. For ring networks, our algorithms solve rendezvous in all feasible instances of the problem, while we show that rendezvous is impossible for an even number of Agents in unoriented rings. For the oriented mesh networks, we prove that the problem can be solved when the honest Agents initially form a connected configuration without holes if and only if they can see which are the occupied nodes within a two-hops distance. To the best of our knowledge, this is the first attempt to study such a powerful and mobile fault model, in the context of mobile Agents. Our model lies between the more powerful but static fault model of black holes (which can even destroy the Agents), and the less powerful but mobile fault model of Byzantine Agents (which can only imitate the honest Agents but can neither harm nor stop them).