The book will be divided into four parts that correspond to three major focus areas of COMSOC, plus a part for additional topics.
Part 1: Voting. This part will consist of roughly half the book, and will cover work on computational aspects of voting, including an introduction to different families of voting rules and the computational complexity of computing the winners; the computational complexity of manipulation in elections, and related strategic behavior; the alternative computational approaches that were studied for the analysis of voting rules, such as communication complexity; and voting with rich combinatorial preferences.
Part 2: Fair division. Computational fair division is a subfield of COMSOC that deals with allocating goods to individuals with heterogeneous preferences in a socially desirable way. We will make the distinction between divisible and indivisible goods. The corresponding chapters will focus on issues related to complexity and optimization.
Part 3: Coalition formation. A third subfield of COMSOC deals with different interpretations of the process of coalition formation when players have preferences over different coalitions. This includes matching (to form coalitions of size two), hedonic games (where coalitions are created based on the preferences of individuals), and weighted voting games (where coalitions emerge to achieve some goal, such as passing a bill in parliament).
Part 4: Additional topics. This part will include topics that have been studied by the COMSOC community, but did not find a home in previous parts: judgement aggregation, ranking systems, and knockout tournaments.