CFP below & distribute as appropriate. Please accept our apologies if
you receive multiple copies.
Best,
Joerg & Vince
**********************************************************************
Call for Papers
      Third International Workshop on Computational Social Choice
                            (COMSOC-2010)
Duesseldorf, Germany, September 13--16, 2010
URL: http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/
**********************************************************************
MISSION
**********************************************************************
Computational social choice  is  a  new  discipline  emerging  at  the
interface  of  social  choice  theory  and  computer  science.  It  is
concerned with the application  of  computational  techniques  to  the
study of social choice mechanisms, and with the integration of  social
choice paradigms into computing. The aim of this workshop is to  bring
together the different communities  that  have  been  addressing  such
issues: computer scientists  interested  in  computational  issues  in
social choice; people working in artificial  intelligence  and  multi-
agent systems who are using  ideas  from  social  choice  to  organize
societies of artificial software agents; logicians interested  in  the
logic-based specification and analysis of  social  procedures (social
software); and last but not least people coming from social choice
theory itself.
COMSOC-2010  will  be  held  in  association  with  the  COST   Action
``Algorithmic Decision Theory,'' and will also  be  accompanied  by  a
``LogICCC tutorial day'' with general introductory talks.  The invited
talks of the workshop and the tutorials will be presented by a  number
of prominent  scientists.   Registration  fees  will  cover  both  the
workshop and the LogICCC tutorial day and will be kept very low.
**********************************************************************
INVITED SPEAKERS
**********************************************************************
Invited speakers will include Gabrielle  Demange  (Paris;  tentative),
Matthew O. Jackson (Stanford), Bettina Klaus (Lausanne), Herve  Moulin
(Rice University), and Hannu Nurmi (Turku).
**********************************************************************
PAPER SUBMISSION
**********************************************************************
Submissions of full papers describing original or  recently  published
work on all aspects of computational social choice are invited. Topics
of interest include, but are not limited to:
 o complexity-theoretic analysis of voting procedures
 o computational aspects of fair division
 o multiagent resource allocation
 o cake-cutting algorithms
 o distributed negotiation in multiagent systems
 o preference representation in combinatorial domains
 o computational aspects of preference aggregation rules
 o preference elicitation
 o social choice and constraint programming
 o social choice and the web: ranking systems
 o social networks
 o belief and judgement aggregation
 o algorithmic game theory
 o computational aspects of coalition formation
 o social choice under uncertainty
 o logics for collective decision making
 o logic-based verification of social procedures
 o communication complexity of social choice mechanisms
 o computational issues in mechanism design
Paper submission is electronic via the workshop website. Papers should
not exceed 14  pages in length (roughly  5000  words)  and  should  be
formatted according to the  instructions  available  at  the  workshop
website. Accepted papers will be collected in informal workshop notes,
printed copies of which will be  available  at  the  workshop.  Please
contact either one of the program chairs in case of any questions:
 o Vince Conitzer (conitzer@cs.duke.edu)
 o Joerg Rothe (rothe@cs.uni-duesseldorf.de)
**********************************************************************
IMPORTANT DATES
**********************************************************************
 o Paper submission deadline: June 1, 2010
 o Notification of authors: July 15, 2010
 o Camera-ready papers due: August 1, 2010
 o Early registration deadline: August 1, 2010
 o LogICCC tutorial day: September 13, 2010
 o Workshop dates: September 14--16, 2010
**********************************************************************
PROGRAM COMMITTEE
**********************************************************************
 o Steven Brams
 o Felix Brandt
 o Vincent Conitzer (co-chair)
 o Edith Elkind
 o Ulle Endriss
 o Piotr Faliszewski
 o Michael R. Fellows
 o Marc Kilgour
 o Jerome Lang
 o Jean-Francois Laslier
 o Noam Nisan
 o Ariel Procaccia
 o Fran Rosamond
 o Jeffrey S. Rosenschein
 o Francesca Rossi
 o Joerg Rothe (co-chair)
 o Remzi Sanver
 o Arkadii Slinko
 o Kristen Brent Venable
 o Toby Walsh
 o Michael Wooldridge
 o William S. Zwicker
**********************************************************************
-- 
Vincent Conitzer
Assistant Professor of Computer Science and Economics
Duke University
conitzer@cs.duke.edu
http://www.cs.duke.edu/~conitzer/
Levine Science Research Center, office D207
Box 90129, Duke University
Durham, NC 27708, USA
Office phone: (919) 660-6503
Fax: (919) 660-6519
**********************************************************
Prof. Dr. Joerg Rothe
Universitaet Duesseldorf, Institut fuer Informatik,
Universitaetsstr. 1, 40225 Duesseldorf, Germany
Phone: +49 211 81 12188, Fax: +49 211 81 11667
rothe@cs.uni-duesseldorf.de
http://ccc.cs.uni-duesseldorf.de/~rothe
**********************************************************
**********************************************************
*    
*   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/
*
**********************************************************
 
 
 
 Posts
Posts
 
