[robotics-worldwide] CFP: OPTMAS IV (Deadline Extension to Feb. 11th)

Alessandro Farinelli alex.farinelli at gmail.com
Fri Jan 28 09:29:37 PST 2011

Dear all,

the deadline to submit contributions to the Fourth International Workshop on
Optimisation in Muli-Agent Systems (OPTMAS IV) has been extended to February
Below you can find the updated CFP, the programme includes an invited talk
by Prof. Sven Koenig.



                CFP: Fourth International Workshop on

           Optimisation in Multi-Agent Systems (OPTMAS IV)

                     To be held in conjunction with the

    Ninth International Conference on Autonomous and Multi-Agent
                            (AAMAS 2011)
                 3 May 2011
                cfp at: http://www.optmas2011.com



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.

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: idm-lab.org.


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
generally require some form of optimization in order to achieve their
Given this, a number of advancements have been made in the design of
determination, coalition formation, and distributed constraints
algorithms among others. However, there are no general principles
the design of such algorithms that would enable researchers to either
exploit solutions designed in other areas or to ensure that their
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
are partly or completely distributed and can only communicate with their

2. Algorithms to compute solutions to mechanisms that deal with
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

7. Mechanisms whose properties can be significantly affected if the
solution computed 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
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:

* Distributed Constraints Optimisation/Satisfaction
* Winner Determination Algorithms in Auctions
* Coalition Formation Algorithms
* Algorithms to compute Nash Equilibrium in games
* Optimisation under uncertainty
* Optimisation with incomplete or dynamic input data
* Algorithms for real-time applications

Important dates

* FEBRUARY, 11th, 2011 (Deadline Extended) - Submission of contributions to
* FEBRUARY, 27th 2010 - Workshop paper acceptance notification
* MAY 3rd, 2011 - Workshop takes place in conjunction with AAMAS 2011.


Submissions should conform to the LNCS Springer format,
Authors are encouraged to use the following style file
or see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 for more

Submission should not be more than *16* pages long (excluding appendices and
assuming the LNCS format above).

Authors can submit their papers through the OPTMAS 2011 Easychair
submission site:


Reviewing process

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

Best papers from OPTMAS 2008 and OPTMAS 2009 were selected for publication
in the
special issue on Optimisation in Multi-Agent System of the Journal of
Autonomous and Multiagent Systems

We plan to continue this initiative for the 2010 and 2011 edition.
Therefore, we
will negotiate the publication of selected, best papers in a quality

Organizing 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 A. Rodriguez Aguilar (IIIA,CSIC, Spain)

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

Dr. Alex Rogers (University of Southampton, UK)

Programme Committee

Anna Bazzan, Instituto de Informatica, UFGRS, Brazil

Christian Blum, Technical University of Catalonia, Spain

Ladislau Boloni, University of Central Florida, USA

Andrea Giovannucci, Universitat Pompeu Fabra, Spain

Pedro Meseguer, IIIA-CSIC, Spain

Nikos Komodakis, University of Crete, Greece

Talal Rahwan, University of Southampton, UK

Kate Larson, University of Waterloo, Canada

Beatriz López, University of Girona, Spain

Onn Shehory, IBM, Israel

Nicolas Stefanovitch, University of Paris 6, France

Greet Vanden Berghe, KaHo Sint-Lieven, Belgium

Meritxell Vinyals, IIIA-CSIC, Spain

Victor Lesser, University of Massachusetts Amherst, USA

Jason Tsai, University of Southern California, Los Angeles, USA.

Christopher Kiekintveld, University of Southern California, Los Angeles,

Kathryn Macarthur, University of Southampton, UK

Robin Glinton, Robotics Institute CMU, USA

Norman Salazar, IIIA-CSIC, Spain

Rober N. Lass, Drexel University, USA

Andrea Roli, Alma Mater Studiorum - Universita' di Bologna, Italy

Paul Scerri, Robotics Institute CMU, USA

Evan A. Sultanik, Drexel University, USA

William Yeoh, University of Southern California, Los Angeles, USA.

Makoto Yokoo, Kyushu University, Japan

Roie Zivan, Ben Gurion University of the Negev, Israel

More information about the robotics-worldwide mailing list