This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.

Second edition of first textbook on computational social choice Connects economic and computational dimensions of collective decision-making Explores the interrelations between algorithmic game theory, computational social choice and fair division

Autorentext

Jörg Rothe is Professor and the Vicechair of Department of Computer Science at Heinrich-Heine-Universität Düsseldorf (Germany). Previously he was a visiting Assistant Professor at the University of Rochester (USA) and a visiting Professor at Stanford University (USA). His research focuses on computational complexity, computational social choice, collective decision making, algorithmic game theory, fair division, argumentation theory, algorithmics and cryptology.

Inhalt

Playing, Voting, and Dividing.- Playing Successfully: Noncooperative Game Theory.- Cooperative Game Theory.- Voting and Judging: Preference Aggregation by Voting.- The Complexity of Manipulative Actions in Single-Peaked Societies.- Multiwinner Voting.- Judgment Aggregation.- Fair Division: Cake-Cutting - Fair Division of Divisible Goods.- Fair Division of Indivisible Goods.