In 2011 the Autonomous Agents and Multiagent Systems (AAMAS) conference series celebrated its 10th anniversary, having begun as the successful merger of three related events that had run for some years previously.

I Have a Robot, and I'm Not Afraid to Use It! The AAMAS community is investing efforts to encourage robotics research within itself. An annual robotics special track, an associated robotics workshop (Autonomous Robots and Multirobot Systems), and a series of exciting AAMAS-sponsored plenary speakers and awards over a number of years are drawing roboticists in. The number of robotics papers is increasing. There are fruitful interactions with the other communities within AAMAS, such as virtual agents, game theory, and machine learning. Robots are being used both to inspire AAMAS research as well as to conduct it. I posit that the growing success of robotics at AAMAS is due not only to the nurturing efforts of the AAMAS community, but mainly to the increasing recognition of an important, deeper, truth: robots are agents.

Negotiation is a complex emotional decision-making process aiming to reach an agreement to exchange goods or services. From an agent technological perspective creating negotiating agents that can support humans with their negotiations is an interesting challenge. Already more than a decade, negotiating agents can outperform human beings (in terms of deal optimality) if the negotiation space is well-understood. However, the inherent semantic problem and the emotional issues involved make that negotiation cannot be handled by artificial intelligence alone, and a human-machine collaborative system is required. This article presents research goals, challenges, and an approach to create the next generation of negotiation support agents.

This article gives an introduction to agent-based modeling and simulation (ABMS). After a general discussion about modeling and simulation, we address the basic concept of ABMS, focusing on its generative and bottom-up nature, its advantages as well as its pitfalls. The subsequent part of the article deals with application-oriented aspects, including selected tools and well-known applications. In order to illustrate the benefits of using ABMS, we focus on several aspects of a well-known area related to simulation of complex systems, namely traffic. At the end, a brief look into future challenges is given.

We present a brief survey of logics for reasoning about multiagent systems. We focus on two paradigms: logics for cognitive models of agency, and logics used to model the strategic structure of a multiagent system.

Multiagent systems (MAS) are widely accepted as an important method for solving problems of a distributed nature. A key to the success of MAS is efficient and effective multiagent learning (MAL). The past twenty-five years have seen a great interest and tremendous progress in the field of MAL. This article introduces and overviews this field by presenting its fundamentals, sketching its historical development and describing some key algorithms for MAL. Moreover, main challenges that the field is facing today are indentified.

The Association for the Advancement of Artificial Intelligence, in cooperation with Stanford University’s Department of Computer Science, was pleased to present the 2012 Spring Symposium Series, held Monday through Wednesday, March 26–28, 2012 at Stanford University, Stanford, California USA. The six symposia held were AI, The Fundamental Social Aggregation Challenge (cochaired by W. F. Lawless, Don Sofge, Mark Klein, and Laurent Chaudron); Designing Intelligent Robots (cochaired by George Konidaris, Byron Boots, Stephen Hart, Todd Hester, Sarah Osentoski, and David Wingate); Game Theory for Security, Sustainability, and Health (cochaired by Bo An and Manish Jain); Intelligent Web Services Meet Social Computing (cochaired by Tomas Vitvar, Harith Alani, and David Martin); Self-Tracking and Collective Intelligence for Personal Wellness (cochaired by Takashi Kido and Keiki Takadama); and Wisdom of the Crowd (cochaired by Caroline Pantofaru, Sonia Chernova, and Alex Sorokin). The papers of the six symposia were published in the AAAI technical report series.

Distributed problem solving is a subfield within multiagent systems, where agents are assumed to be part of a team and collaborate with each other to reach a common goal. In this article, we illustrate the motivations for distributed problem solving and provide an overview of two distributed problem solving models, namely distributed constraint satisfaction problems (DCSPs) and distributed constraint optimization problems (DCOPs), and some of their algorithms.

Supply Chain coordination has become a critical success factor for Supply Chain management (SCM) and effectively improving the performance of organizations in various industries. Companies are increasingly located at the intersection of one or more corporate networks which are designated by "Supply Chain". Managing this chain is mainly based on an 'information sharing' and redeployment activities between the various links that comprise it. Several attempts have been made by industrialists and researchers to educate policymakers about the gains to be made by the implementation of cooperative relationships. The approach presented in this paper here is among the works that aim to propose solutions related to information systems distributed Supply Chains to enable the different actors of the chain to improve their performance. We propose in particular solutions that focus on cooperation between actors in the Supply Chain.

The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed. The new technique uses a parallel model for a problem variant that allows a slight movement of nodes within their Neighborhoods. The algorithm is tested with success on several large data sets.