DipTools: Experimental Data Visualization Tool for the DipGame Testbed (Demonstration)
General Shape Grammar Interpreter for Intelligent Designs Generations
Tipo de Publicación:Conference Paper
Origen:Computer Graphics, Imaging and Visualization, CGIV'09, IEEE Computer Society, Volumen6, Tianjin, China, p.235-240 (2009)
Palabras clave:shape grammars; electronic institution; virtual world; 3D; interpreter
Shape grammars play an important role in a new generation of tools for the analysis and design of products. In this work we present a general tool named Shape Grammar Interpreter (SGI) for the automatic generation of designs. The developed shape grammar framework allows designers to obtain automatically generated designs and to participate in the design process. In that way the generated design complies with both the desired functionality and an attractive aspect. Great effort has been devoted on having a comfortable way of defining shapes and later using them in shape grammar rules and designs’ generation process. We have also implemented and incorporated in the tool an optimized subshape detection algorithm. Hence, subshapes of the existing shapes can be detected in the generation process obtaining more appealing designs.
A Testbed for Multiagent Systems
Tipo de Publicación:Report
Origen:IIIA-TR-2009-09, IIIA-CSIC, Bellaterra, Barcelona, p.18 (2009)
Palabras clave:application; testbed; diplomacy game
There is a chronic lack of shared application domains to test the research models and agent architectures on areas like negotiation, argumentation, trust and reputation. In this paper we introduce such a friendly testbed that we used for all such purposes. The testbed is based on the Diplomacy Game due to its lack of random moves and because of the essential role that negotiation and the relationships between the players play in the game. The testbed may also profit from the existence of a community of bot developers and a large number of human players that would provide data for our experiments. We offer the infrastructure and make it freely available to the MAS community.
Group Recognition through Social Norms.
Tipo de Publicación:Conference Paper
Origen:8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, p.1347-1348 (2009)
This paper examines the decentralized recognition of groups within a multiagent normative society. In this work we explore different mechanisms that allow agents to recognize the others as members of a certain social group. Considering as the basic mechanism the one that makes agents interact with other agents without considering the previous interactions and with no communication, three new algorithms have been developed and tested to improve the efficiency of the basic one. These algorithms are: (1) the whitelisting, (2) the blacklisting, and (3) the labelling algorithm. Moreover, a reinterpretation of the definition of group is done in order to make it more dynamic and flexible with respect to the environment where agents are located. Analysis on simulation results confirms the effectiveness of this dynamic member evaluation function.
Reducing Communication Cost via Overhearing
A multiagent network for peer norm enforcement
Tipo de Publicación:Journal Article
Origen:Autonomous Agents and Multi Agent Systems, Volumen21, p.397-424 (2010)
Palabras clave:Multiagent systems; norms; enforcement; social network; ostracism
In a multiagent system where norms are used to regulate the actions agents ought to execute, some agents may decide not to abide by the norms if this can benefit them. Norm enforcement mechanisms are designed to counteract these benefits and thus the motives for not abiding by the norms. In this work we propose a distributed mechanism through which agents in the multiagent system that do not abide by the norms can be ostracised by their peers. An ostracised agent cannot interact anymore and looses all benefits from future interactions. We describe a model for multiagent systems structured as networks of agents, and a behavioural model for the agents in such systems. Furthermore, we provide analytical results which show that there exists an upper bound to the number of potential norm violations when all the agents exhibit certain behaviours. We also provide experimental results showing that both stricter enforcement behaviours and larger percentage of agents exhibiting these behaviours reduce the number of norm violations, and that the network topology influences the number of norm violations. These experiments have been executed under varying scenarios with different values for the number of agents, percentage of enforcers, percentage of violators, network topology, and agent behaviours. Finally, we give examples of applications where the enforcement techniques we provide could be used.