[agents] CFP: International Workshop on Optimisation in Multi-Agent Systems (OptMAS 2018)

Mon Mar 12 22:49:22 EDT 2018

=======================================================

CFP: International Workshop on Optimisation in Multi-Agent Systems (OptMAS 2018)

To be held in conjunction with the Federated Artificial Intelligence Meeting (FAIM), in Stockholm, Sweden, from July 10-19, 2018, which includes AAMAS, JCAI-ECAI and ICML.

=======================================================

This OptMAS 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 optimization problems. We will also place a particular emphasis on DCR approaches, which include the modeling, formulation and solution of DCR problems, including both Distributed Constraint Satisfaction and Optimization Problems.

OptMAS 2018 website: http://www-personal.umich.edu/~fioretto/cfp/OPTMAS18/

Conference submission site: https://easychair.org/conferences/?conf=optmas2018

Important dates

-----------------------

* April 23, 2018 - Workshop submission deadline

* May 30, 2018 - Workshop paper acceptance notification

* June 16, 2018 - Submission of camera-ready version

* July 14 or 15, 2018 - Workshop takes place in conjunction with FAIM 2018

Background

-----------------

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 multi-sensor networks, to scheduling of tasks in multi-actor systems. Multi-agent systems designed for all these applications generally involve some form of very hard optimization problems that are substantially different from problems traditionally dealt with in other areas (e.g. industrial processes or scheduling applications). More specifically, the technical issues that multi-agent algorithm designers have to deal with include:

* Open systems: algorithms to compute solutions to mechanisms that deal with different stakeholders, who may be self-interested or may have different computation or communication capabilities from their peers.

* Distributed systems: algorithms that are across different system components, such as those that deal with agents that are tied to physical devices. This involves considerations of computation and communication constraints, and the possibility of failures of the components and/or communication links.

* Privacy concerns: solving optimization problems while minimizing the exchange of private information.

* Solution quality bounds: problems requiring anytime and/or approximate algorithms with quality bounds.

* Robust optimization: techniques to deal with optimizations that are repeated with only slight changes in the input data and/or with unreliable input data, which require solutions that are robust to these differences.

* Highly parallel architectures: e.g., multi-core, GPGPU, which deal with large-scale problems with massive data and task parallelism.

In particular, workshop organizers are seeking papers on the following (but not limited to) topics:

* Distributed constraint optimization/satisfaction

* Winner determination algorithms in auctions

* Coalition formation algorithms

* Algorithms to compute Nash and other equilibria in games

* Optimization under uncertainty

* Optimization with incomplete or dynamic input data

* Algorithms for real-time applications

* GPU for general purpose computations (GPGPU)

* Multi-core and many-core computing

* Cloud, distributed and grid computing

OptMAS places particular emphasis on distributed constraint reasoning (DCR) approaches, which include the modeling, formulation and solution of DCR problems, including both Distributed Constraint Satisfaction and Optimization Problems. DCR problems arise when pieces of information about variables, constraints or both are relevant to independent but communicating agents. They provide a promising framework to deal with the increasingly diverse range of distributed real world problems emerging from the evolution of computation and communication technologies. Example DCR-specific technical issues include:

* Unified frameworks for distributed constraint reasoning

* Complete and incomplete algorithms for solving distributed constraint reasoning problems

* Privacy issues in distributed constraint reasoning

* Problem solving in systems with self-interested agents

* Negotiation among self-interested agents

* Distributed constraint propagation and consistency

* Generation and formulation/modeling of distributed constraint reasoning

* Applications of distributed constraint reasoning

Keywords

--------------

Topics include but are not limited to the theory and applications of:

*  Winner determination algorithms in auctions

*  Coalition formation algorithms

*  Scheduling and task allocation problems

*  Complete and incomplete algorithms for solving distributed constraint reasoning problems

*  Unified frameworks for distributed constraint reasoning

*  Handling privacy issues in multi-agent systems and distributed constraint reasoning

*  Algorithms to compute solutions to games (cooperative or non-cooperative)

*  Optimization under uncertainty

*  Optimization with incomplete or dynamic input data

*  Algorithms for real-time applications

*  GPU for general purpose computations (GPGPU)

*  Multi-core and many-core computing

*  Cloud, distributed and grid computing

Submission

-----------------

Participants should submit a paper (maximum *15* pages in LNCS Springer style), describing their work on one or more of the topics relevant to the workshop. Alternatively, participants may submit a shorter paper (maximum *5* pages in LNCS Springer style) presenting a research statement or perspective on topics relevant to the workshop.

Submissions should include the name(s), affiliations, and email addresses of all authors. We welcome the submission of papers rejected from the AAMAS 2018 and IJCAI/ECAI 2018 technical program.

The deadline for receipt of submissions is April 23, 2018. Papers received after this date may not be reviewed.

All submissions are conducted via the OptMAS 2018 EasyChair website: http://www.easychair.org/conferences/?conf=optmas2018<https://www.easychair.org/conferences/?conf=optmas2018>

Reviewing process

---------------------------

Papers will be reviewed by at least 2 program committee members. Criteria for selection of papers will include: technical quality, novelty, significance, and clarity.

Organizing committee

--------------------------------

Dr. Archie Chapman, University of Sydney

Dr. Ferdinando Fioretto, University of Michigan

Dr. Long Tran-Thanh, University of Southampton

Dr. Roie Zivan, Ben-Gurion University of the Negev

Programme Committee

--------------------------------

TBC

___
Dr Archie Chapman
Research Fellow in Smart Grids
Centre for Future Energy Networks, School of Electrical and Information Engineering
University of Sydney
Room 416, Electrical Engineering Building, J03 | University of Sydney | NSW 2006
E: archie.chapman at sydney.edu.au | T: +61 2 8627 0386 | F: +61 2 9351 3847
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.cs.umbc.edu/pipermail/agents/attachments/20180313/05c9bf49/attachment-0001.html>