That was a very fun and engaging day!  Thanks everyone for coming out and making it one of the best EXPLORE workshops yet.  Some photos are below and the papers will be up on the Program page until I stop paying for the PrefLib domain!  –Nick


Recent Updates

  • [May 5, 2016] We have posted the schedule for the day over on the Program page!
  • [April 15, 2016] We have posted the accepted papers and PDFs over on the Program Page!  You can also download the entire proceedings as a single PDF.
  • [Feb 6, 2016] We have extended the deadline to Feb 14th to allow everyone time after IJCAI to submit!
  • [Jan 25, 2016] We are excited to announce that Tuomas Sandholm will be giving an invited talk at EXPLORE-2016. Tuomas is a leading researcher in Artificial Intelligence and Operations Research and has contributed to a number of important practical research areas including organ exchange, auctions, and computer poker!
  • [Dec. 14, 2015] We are happy to announce that AAMAS will be publishing the Most Visionary Paper and The Best Paper from the workshop.  These selections will be made by the PC according to the criteria outlined by AAMAS.  Publishing in these venues is not a requirement of submission.
  • [Nov. 12, 2015] The 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2016) will be held at AAMAS 2016 in Singapore.

Call For Papers

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 inside computer science study group decision making and preference aggregation. The computer science view of social choice focuses on computational aspects of classical social choice and importing ideas from further afield (i.e. classical social choice) into computer science, broadly. While the surge of research in this area has created dramatic benefits in the areas of matching markets, recommendation systems, and preference aggregation, much of the ComSoc community remains focused on worst case assumptions.

As ComSoc evolves in the coming years there will be 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, advanced 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
  • 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 in practice
  • 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.

Important Dates

  • Paper Submission Deadline: February 7th, 2016 February 14th, 2016.
  • Author Notification: March 5th, 2016.
  • Camera Ready Deadline: March 10th, 2016.
  • Workshop(s): May 10th, 2016.
  • AAMAS 2016: May 11th – 13th, 2016