Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division (Springer Texts in Business and Economics) - Softcover

Über die Autorin bzw. den Autor

Dorothea Baumeister from Heinrich-Heine-Universität Düsseldorf, Germany, has coauthored Chapter 4 on preference aggregation by voting and Chapter 6 on judgment aggregation.

Edith Elkind from University of Oxford, UK, has coauthored Chapter 3 on cooperative game theory.

Gábor Erdélyi from University of Siegen, Germany, has coauthored Chapter 6 on judgment aggregation.

Piotr Faliszewski from AGH University of Science and Technology in Kraków, Poland, has coauthored Chapter 2 on noncooperative game theory.

Edith Hemaspaandra from Rochester Institute of Technology, USA, has coauthored Chapter 5 on the complexity of manipulative actions in single-peaked societies.

Lane A. Hemaspaandra from University of Rochester, USA, also has coauthored Chapter 5 on the complexity of manipulative actions in single-peaked societies.

Jérôme Lang from CNRS-LAMSADE, Université Paris-Dauphine, France, has coauthored Chapter 8 on fair division of indivisible goods.

Irene Rothe from Bonn-Rhein-Sieg University of Applied Sciences, Germany, has coauthored Chapter 2 on noncooperative game theory.

Jörg Rothe from Heinrich-Heine-Universität Düsseldorf, Germany, has written introductory Chapter 1 and has coauthored Chapters 2–8.

Von der hinteren Coverseite

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.