BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2008/newsitem/2229/15-
 September-2008-submission-deadline-Special-Issue-o
 f-the-Mathematical-Logic-Quarterly-on-Logic-and-Co
 mplexity-within-Computational-Social-Choice-
DTSTAMP:20080203T000000
SUMMARY:15 September 2008 (submission deadline), S
 pecial Issue of the Mathematical Logic Quarterly o
 n "Logic and Complexity within Computational Socia
 l Choice"
DTSTART;VALUE=DATE:20080915
DTEND;VALUE=DATE:20080915
DESCRIPTION:The focus of this special issue is on 
 logic and complexity within computational social c
 hoice. For example, while it is known from (classi
 cal) social choice theory that essentially all nat
 ural voting systems are manipulable in principle, 
 recent research results have shown that computatio
 nal complexity can be used to protect, to some ext
 ent, certain election systems against attempts of 
 changing an election's outcome, i.e., these system
 s can be shown to be resistant to (various types o
 f) manipulation, procedural control, or bribery. A
 s two examples regarding the use of logic within c
 omputational social choice, we mention the logic-b
 ased specification and verification of social proc
 edures and the compact representation of preferenc
 es via logic-based languages.   Original research 
 papers (and also survey papers) related to any asp
 ects of applying logic or computational complexity
  to issues arising in computational social choice 
 are sought.    For more information, see http://cc
 c.cs.uni-duesseldorf.de/~rothe/MLQ-special-issue-C
 FP.
X-ALT-DESC;FMTTYPE=text/html:\n      <p>\n        
 The focus of this special issue is on logic and co
 mplexity within computational social choice. For e
 xample, while it is known from (classical) social 
 choice theory that essentially all natural voting 
 systems are manipulable in principle, recent resea
 rch results have shown that computational complexi
 ty can be used to protect, to some extent, certain
  election systems against attempts of changing an 
 election's outcome, i.e., these systems can be sho
 wn to be resistant to (various types of) manipulat
 ion, procedural control, or bribery. As two exampl
 es regarding the use of logic within computational
  social choice, we mention the logic-based specifi
 cation and verification of social procedures and t
 he compact representation of preferences via logic
 -based languages.\n      </p>\n      <p>Original r
 esearch papers (and also survey papers) related to
  any aspects of applying logic or computational co
 mplexity to issues arising in computational social
  choice are sought.\n      </p>\n    \n      <p>\n
         For more information, see <a target="_blan
 k" href="http://ccc.cs.uni-duesseldorf.de/~rothe/M
 LQ-special-issue-CFP">http://ccc.cs.uni-duesseldor
 f.de/~rothe/MLQ-special-issue-CFP</a>.\n      </p>
 \n    
URL:/NewsandEvents/Archives/2008/newsitem/2229/15-
 September-2008-submission-deadline-Special-Issue-o
 f-the-Mathematical-Logic-Quarterly-on-Logic-and-Co
 mplexity-within-Computational-Social-Choice-
END:VEVENT
END:VCALENDAR