15 September 2008 (submission deadline), Special Issue of the Mathematical Logic Quarterly on "Logic and Complexity within Computational Social Choice"

The focus of this special issue is on logic and complexity within computational social choice. For example, while it is known from (classical) social choice theory that essentially all natural voting systems are manipulable in principle, recent research results have shown that computational complexity 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 shown to be resistant to (various types of) manipulation, procedural control, or bribery. As two examples regarding the use of logic within computational social choice, we mention the logic-based specification and verification of social procedures and the compact representation of preferences via logic-based languages.

Original research papers (and also survey papers) related to any aspects of applying logic or computational complexity to issues arising in computational social choice are sought.

For more information, see http://ccc.cs.uni-duesseldorf.de/~rothe/MLQ-special-issue-CFP.