Wednesday, November 25, 2015

[DMANET] New Book: Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division

Dear Colleagues,

it is my pleasure to announce that a new book has just been
published by Springer:

Economics and Computation
An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division

Jörg Rothe (Editor)

http://www.springer.com/de/book/9783662479032

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.

- 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

TABLE OF CONTENTS:

Foreword by Matthew O. Jackson and Yoav Shoham. . . . . . . . . . . . . v
Preface by the Editor . . . . . . . . . . . . . . . . . . . . . . . . .vi
Contributors . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii

Chapter 1:
Playing, Voting, and Dividing . . . . . . . . . . . . . . . . . . . . . 1
J. Rothe

Chapter 2:
Noncooperative Game Theory . . . . . . . . . . . . . . . . . . . . . . 41
P. Faliszewski, I. Rothe, and J. Rothe

Chapter 3:
Cooperative Game Theory . . . . . . . . . . . . . . . . . . . . . . . 135
E. Elkind and J. Rothe

Chapter 4:
Preference Aggregation by Voting . . . . . . . . . . . . . . . . . . 197
D. Baumeister and J. Rothe

Chapter 5:
The Complexity of Manipulative Actions in Single-Peaked Societies . . 327
E. Hemaspaandra, L.A. Hemaspaandra, and J. Rothe

Chapter 6:
Judgment Aggregation . . . . . . . . . . . . . . . . . . . . . . . . 361
D. Baumeister, G. Erdélyi, and J. Rothe

Chapter 7:
Cake-Cutting: Fair Division of Divisible Goods . . . . . . . . . . . 395
C. Lindner and J. Rothe

Chapter 8:
Fair DivisionofIndivisible Goods . . . . . . . . . . . . . . . . . . 493
J. Lang and J. Rothe

References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . 581
List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . 585
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 587

Best regards,
Jörg Rothe

**********************************************************
Prof. Dr. Jörg Rothe
Universität Düsseldorf, Institut für Informatik
Department Chair
Universitätsstr. 1, 40225 Düsseldorf, Germany
Phone: +49 211 81 12188, Fax: +49 211 81 11667
rothe@cs.uni-duesseldorf.de
http://ccc.cs.uni-duesseldorf.de/~rothe
**********************************************************

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************