To be held at the 15th Conference for Autonomous Agents and Multi-Agent Systems, AAMAS 2016
May 9th or 10th, 2016
Computational Social Choice (ComSoc) is a rapidly developing field at the intersection of computer science, economics, social choice, and political science. Many, often disjoint, groups of researchers both outside and within computer science study group decision making and preference aggregation. The computer science view of social choice focuses on computational aspects of social choice and importing ideas from social choice into computer science, broadly. While the surge of research in this area has created dramatic benefits in the areas of market matchings, recommendation systems, and preference aggregation, much of the ComSoc community remains focused on worst case assumptions.
As ComSoc evolves there is an increased need to relax or revise some of the more common assumptions in the field: worst case complexity, complete information, and overly-restricted domains, among others. This means going beyond traditional algorithmic and complexity results and providing a more nuanced look, using real data, parameterized algorithms, and human and agent experimentation to provide a fresh and impactful view of group decision making. This goes hand in hand with highlighting the practical applications of much of the theoretical research - as much of the most impactful work in ComSoc does. It also involves looking at more complex preference aggregation settings that help model real world requirements.
We encourage research related to:
* Empirical Studies
* Average case analysis
* Identification of tractable sub-cases
* Fixed parameter complexity analysis
* Benchmarking and analysis from the preference handling and recommendation systems
* Studies of matching and auction mechanisms
* Crowd-sourcing and other real-world data aggregation domains.
Many of these tools, techniques, and studies are concentrated in a particular sub-field and researchers in other areas of ComSoc and related communities may be keen to import some of the tools and techniques developed in other areas.
The workshop is currently scheduled for a full day. We plan for the program to include an invited talk from a local researcher and possibly a short tutorial.
Paper Submission Deadline: February 1, 2016
Author Notification: March 1, 2016
Conference and Workshop: May 9 or 10, 2016
Haris Aziz, Data61 and UNSW
Felix Brandt, Technische Universität München
David Manlove, University of Glasgow
Nicholas Mattei, Data61 and UNSW
Submissions will be handled by EasyChair, the site is available at https://easychair.org/conferences/?conf=explore2016.
Papers should be in AAMAS format, allowing 8 pages of text plus 1 page for references.
Travel and Attendance Information
The workshop will be held in conjunction with AAMAS 2016 in Singapore. Please see the AAMAS website for more information regarding registration, travel, and accommodations: http://sis.smu.edu.sg/aamas2016.
We hope to see you there.
--Haris, Felix, David, and Nicholas
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)