Overview
- 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
- First book focusing on the algorithmic and complexity-theoretic aspects of fair division
Part of the book series: Springer Texts in Business and Economics (STBE)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (8 chapters)
-
Front Matter
-
Playing Successfully
-
Front Matter
-
-
Voting and Judging
-
Front Matter
-
-
Fair Division
-
Front Matter
-
-
Back Matter
Keywords
About this book
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.
Editors and Affiliations
About the editor
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.
Claudia Lindner from University of Manchester, UK, has coauthored Chapter 7 on cake-cutting: fair division of divisible 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.
Bibliographic Information
Book Title: Economics and Computation
Book Subtitle: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division
Editors: Jörg Rothe
Series Title: Springer Texts in Business and Economics
DOI: https://doi.org/10.1007/978-3-662-47904-9
Publisher: Springer Berlin, Heidelberg
eBook Packages: Economics and Finance, Economics and Finance (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2016
Hardcover ISBN: 978-3-662-47903-2Published: 27 August 2015
Softcover ISBN: 978-3-662-51044-5Published: 23 August 2016
eBook ISBN: 978-3-662-47904-9Published: 18 August 2015
Series ISSN: 2192-4333
Series E-ISSN: 2192-4341
Edition Number: 1
Number of Pages: XIII, 612
Number of Illustrations: 114 b/w illustrations, 9 illustrations in colour
Topics: Economic Theory/Quantitative Economics/Mathematical Methods, Algorithm Analysis and Problem Complexity, International Political Economy, Game Theory, Economics, Social and Behav. Sciences, Public Economics