Fourth International Workshop on:

Optimisation in Multi-Agent Systems


To be held in conjunction with the
  Tenth Joint Conference on Autonomous and Multi-Agent Systems

Taipei, Taiwan
(AAMAS 2011)
  3 May 2011



This workshop invites works from different strands of the multi-agent systems community that pertain to the design of algorithms, models, and techniques to deal with multi-agent optimisation problems. In so doing, this workshop aims to provide a forum for researchers to discuss common issues that arise in solving optimisation problems in different areas and elaborate common benchmarks to test their solutions.


9:00 -- 10:30 Opening and 1st Morning session

10:30 -- 11:00 Coffee break

11:00 -- 13:00 2nd Morning session

13:00 -- 14:00 Lunch break

14:00 -- 15:30 1st Afternoon session

15:30 -- 16:00 Coffee break

16:00 -- 18:00 2nd Afternoon session

18:00 Closing.

Invited Talk

Prof. Sven Koenig

Sven Koenig is an associate professor in computer science at the University of Southern California. Most of his research centers around techniques for decision making (planning and learning) that enable single situated agents (such as robots or decision-support systems) and teams of agents to act intelligently in their environments and exhibit goal-directed behavior in real-time, even if they have only incomplete knowledge of their environment, imperfect abilities to manipulate it, limited or noisy perception or insufficient reasoning speed. Additional information about Sven can be found on his webpages:


The number of novel applications of multi-agent systems has followed an exponential trend over the last few years, ranging from online auction design, through in multi-sensor networks, to scheduling of tasks in multi-actor systems. Multi-agent systems designed for all these applications generally require some form of optimization in order to achieve their goal. Given this, a number of advancements have been made in the design of winner determination, coalition formation, and distributed constraints optimization algorithms among others. However, there are no general principles guiding the design of such algorithms that would enable researchers to either exploit solutions designed in other areas or to ensure that their algorithms conform to some level of applicability to real problems.

This workshop aims to address the above issues by bringing together researchers from different parts of the Multi-Agent Systems research area to present their work and discuss acceptable solutions, benchmarks, and evaluation methods for generally researched optimization problems.

In particular, the main issues to be addressed by the workshop include (but are not limited to):

  1. Techniques to model and solve optimisation problems in which the actors are partly or completely distributed and can only communicate with their peers.
  2. Algorithms to compute solutions to mechanisms that deal with different stakeholders who may be self interested or may have different computation/communication capabilities from their peers.
  3. Techniques to manage and disseminate relevant information across
    different agents.
  4. Dealing with privacy concerns: solving complex optimization problems while leaking as little private information as possible.
  5. Problems that require anytime algorithms.
  6. Algorithms that need to provide guarantees on the quality of the solution.
  7. Mechanisms whose properties can be significantly affected if the computed solution is not the optimal one.
  8. Techniques to deal with optimizations that have to be repeated with possibly only slight changes in the input data.
  9. Techniques to deal with situations where the input data may be uncertain or unreliable, requiring that the solution computed be robust to slight differences from the true values
  10. Techniques to deal with agents that are tied to physical devices. This involves computation and communication constraints that need to be considered in the coordination techniques, as well as the possibility of failures of the devices and communication links.
  11. Benchmarks for optimisation algorithms in dynamic environments.


Topics include but are not limited to:

Important Dates:

Submission and review

Submissions should conform to the LNCS Springer format,
Authors are encouraged to use the following style file
or see the Springer web site for more details.

Submission should not be more than 18 pages long (excluding appendices and assuming the LNCS format above).
Authors can submit their papers through the OPTMAS 2011 Easychair submission site

Each paper will be reviewed by at least 2 reviewers. Criteria for selection of papers will include: originality, readability, relevance to themes,
soundness, and overall quality.



After OPTMAS 2009 the best papers were selected for publication in a forthcoming issue of the Journal of Autonomous and Multiagent Systems. 
We plan to continue this initiative for the 2011 edition. Therefore, we will negotiate the publication of selected, best papers in a quality journal.


Organising Committee

Dr. Alessandro Farinelli (University of Verona, Italy)

Prof. Nicholas R. Jennings (University of Southampton, UK)

Dr. Sarvapali D. Ramchurn (University of Southampton, UK)

Dr. Juan Antonio Rodriguez Aguilar (IIIA,CSIC, Spain)

Dr. Jesus Cerquides Bueno (IIIA,CSIC, Spain)

Dr. Alex Rogers (University of Southampton, UK)


Primary contact

Dr. Alessandro Farinelli (University of Verona, Italy)

Programme Committee

Alessandro Farinelli
Andrea Giovannucci
Robin Glinton
Nikos Komodakis
Kate Larson
Victor Lesser
Beatriz López
Kathryn Macarthur
Norman Salazar
Paul Scerri
Onn Shehory
Nicolas Stefanovitch
Jason Tsai
Roie Zivan