Sunday, February 7, 2016

[DMANET] [Deadline Extension 14 Feb. 2016] CFP: EXPLORE @ AAMAS 2016: The 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice

[Apologies for multiple postings.]

*In order to accommodate submissions from IJCAI, AAMAS, and AAAI we have
extended the deadline for EXPLORE by 1 week to Feb. 14th.*

*[Final Call] CFP: EXPLORE 2016 @ AAMAS 2016: The 3rd Workshop on Exploring
Beyond the Worst Case in Computational Social Choice *

To be held at the 15th Conference for Autonomous Agents and Multi-Agent
Systems, AAMAS 2016.

May 10th, 2016

Singapore

http://www.explore-2016.preflib.org/

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:

* 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
* 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.

Program Notes
------------------------------

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.

AAMAS-2016 is happy to announce that selected workshop papers will be
published by Springer under two books. The aim of these books is to
encourage innovative and visionary papers, even if their research work is
still at a preliminary stage. The first book will be a compilation of the
most visionary papers of the AAMAS-2016 Workshops, where one paper will be
selected from each AAMAS-2016 workshop. The second book will be a
compilation of the best papers of the AAMAS-2016 Workshops, where again one
paper (different from the selected visionary paper) will be selected from
each AAMAS-2016 workshop. These papers will be selected by the PC nominated
to the AAMAS workshop chairs.


Important Dates
-------------------------------

Paper Submission Deadline: February 14, 2016

Author Notification: March 5, 2016

Conference and Workshop: May 10, 2016


Submission Instructions
-------------------------------

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.

Organization Committee
-------------------------------

Haris Aziz, Data61 and UNSW

Felix Brandt, Technische Universität München

David Manlove, University of Glasgow

Nicholas Mattei, Data61 and UNSW

Program Committee
-------------------------------

Peter Biro, Institute of Economics, Centre for Economic and Regional
Studies, Hungarian Academy of Sciences
Markus Brill, Oxford University
John P. Dickerson, Carnegie Mellon University
Edith Elkind, University of Oxford
Gabor Erdelyi, University of Siegen
Piotr Faliszewski, AGH University of Science and Technology
Rupert Freeman, Duke University
Serge Gaspers, UNSW Australia and Data61
Umberto Grandi, University Toulouse 1 Capitole
Jerome Lang, LAMSADE
Kate Larson, University of Waterloo
Omer Lev, University of Toronto
Reshef Meir, Technion-Israel Institute of Technology
Nina Narodytska, Samsung Research America
Maria Silvia Pini, University of Padova
Mark Wilson, University of Auckland
Lirong Xia, Rensselaer Polytechnic Institute (RPI)
K. Brent Venable, Tulane University and IHMC

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.

--

*Nicholas Mattei*

Senior Researcher | Optimisation / Algorithmic Decision Theory

Lecturer | University of New South Wales (UNSW)

*DATA61 | CSIRO*

E nicholas.mattei@nicta.com.au T +61 2 8306 0464 W www.nickmattei.net

Neville Roach Laboratory (UNSW Campus), Locked Bag 6016, Sydney NSW 1466,
Australia

www.data61.csiro.au


CSIRO's Digital Productivity business unit and NICTA have joined forces to
create digital powerhouse Data61

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************