| |||||||||||||
EXPLORE 2017 : EXPLORE 2017 @ AAMAS 2017: The 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice | |||||||||||||
Link: http://www.explore-2017.preflib.org/ | |||||||||||||
| |||||||||||||
Call For Papers | |||||||||||||
CFP: EXPLORE 2017 @ AAMAS 2017: The 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice
To be held at the 16th Conference for Autonomous Agents and Multi-Agent Systems, AAMAS 2017. May 8th or 9th, 2017 São Paulo, Brazil http://www.explore-2017.preflib.org/ Computational Social Choice (ComSoc) lies 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, broadly, on computational aspects of social choice and importing ideas from social choice into computer science. 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 is focused on worst case assumptions. As ComSoc evolves there is a growing 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: * Algorithms and analysis * Empirical Studies * Average case analysis * Identification of tractable sub-cases * Fixed parameter complexity analysis * Benchmarking and analysis from the preference handling and recommendation systems * Matchings under preferences * Auction and market design in the real world * Crowd-sourcing and other real-world data aggregation domains * Ethical decision making (with applicative bent) 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. Important Dates ------------------------------- Paper Submission Deadline: February 22, 2017 Author Notification: March 2, 2017 Conference and Workshop: May 8 or 9, 2017 Submission Instructions ------------------------------- Submissions will be handled by EasyChair, the site is available at https://easychair.org/conferences/?conf=explore2017 Papers should be in AAMAS format, allowing 8 pages of text plus 1 page for references. Organization Committee ------------------------------- Haris Aziz, Data61 and UNSW John P. Dickerson, University of Maryland Omer Lev, University of Toronto Nicholas Mattei, IBM Research Travel and Attendance Information ----------------------------------- The workshop will be held in conjunction with AAMAS 2017 in São Paulo, Brazil. Please see the AAMAS website for more information regarding registration, travel, and accommodations: http://www.aamas2017.org We hope to see you there. --Haris, John, Omer, and Nick. |
|