| |||||||||||||||
MODeM@AAMAS 2017 : Multi-Objective Decision Making (MODeM) workshop at AAMAS 2017 | |||||||||||||||
Link: http://rbr.cs.umass.edu/modem/ | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
About the workshop
-------------------- In the modern world, many problems have more than one objective. When a priori scalarisation of such a multi-objective problem is not possible, explicitly multi-objective methods are necessary to enable (multi-)agent systems for these environments. The Multi-Objective Decision Making (MODeM) workshop aims to bring together people from across the agents community and beyond. Inside of the agents community (and the operations research, control theory and robotics communities), researchers have recently been working on multi-objective: decision-theoretic planning, reinforcement learning, multi-agent coordination, constraint optimisation problems, path planning and game theory. In adjacent communities, multi-objective evolutionary algorithms and multi-objective (heuristic) optimisation, and multi-criteria decision-making and multi-attribute utility theory, are large and long-established (sub)fields. Another highly related problem is that of preference elicitation with respect to different objectives, which is studied in the field of computational social choice. The goal of this workshop is to bring together ideas from all these (sub)fields and communities, leading to cross-pollination, and hopefully interesting new collaborations. MODeM is officially endorsed by the International Society on Multiple Criteria Decision Making (MCDM): http://www.mcdmsociety.org/content/events-endorsed-mcdm-society Scope and submission ----------------------- We invite novel papers on multi-objective decision making, synergies between multi-objective decision making and other topics, and applications of multi-objective decision making. Topics of interest include, but are not limited to, the following: - Multi-objective planning and scheduling - Multi-objective multi-agent coordination - Multi-objective constraint optimisation and graphical models - Multi-objective reinforcement learning - Multiple objectives in game theory and mechanism design - Multi-objective evolutionary methods for autonomous agents and multi-agent systems - Applications of multi-objective decision making - Multi-objectification in autonomous agents and multi-agent systems - Preference elicitation and computational social choice for multi-objective decision making Submissions should follow standard AAMAS 2017 full-paper submission guidelines (maximum 8 pages of content plus any number of additional pages for only references). The authors should submit novel work that matches one or more of the topics relevant to the workshop. Authors are requested to prepare papers using the AAMAS 2017 style (please do not modify): http://www.aamas2017.org/submission-instructions_aamas2017.php Submit papers to MODeM via EasyChair: https://easychair.org/conferences/?conf=modem2017. Proceedings ------------- The most “visionary paper” will be published by Springer in a book under the Lecture Notes in Artificial Intelligence (LNAI) Hot Topics series. The book will be a compilation of the most visionary papers of the AAMAS2017 Workshops, where one paper will be selected from each AAMAS2017 workshop. Additionally, the “best paper” will be published by Springer in a book under the Communications in Computer and Information Science (CCIS) series. The book will be a compilation of the best papers of the AAMAS2017 Workshops, where one paper will be selected from each AAMAS2017 workshop. Authors of the selected most visionary paper and the best paper are expected to provide their latex files promptly upon request. Important Dates ---------------- Paper Submission: Tuesday, 07.02.2017 Notification of Acceptance: Thursday, 02.03.2017 Camera-Ready Submission: Friday, 17.03. 2017 Workshop Date: Monday, 08.05.2017 or Tuesday, 09.05.2017 For more information, please see our website: http://rbr.cs.umass.edu/modem/ or contact us via modem.aamas@gmail.com. |
|