Call for Papers

This Call for Papers is also available in text format. For printing, please use the flyer.

Submissions of 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:

• complexity-theoretic analysis of voting procedures
• computational aspects of fair division
• cake-cutting algorithms
• distributed negotiation in multiagent system
• preference representation in combinatorial domains
• computational aspects of preference aggregation rules
• preference elicitation
• social choice and constraint programming
• social choice and the web: ranking systems
• belief and judgement aggregation
• computational aspects of coalition formation
• social choice under uncertainty
• logics for collective decision making
• logic-based verification of social procedures
• communication complexity of social choice mechanisms
• computational issues in mechanism design