Normal view MARC view ISBD view

Economics and computation : an introduction to algorithmic game theory, computational social choice, and fair division

By: Rothe, Jorg [ed.].
Contributor(s): Rothe, Irene [ill.].
Series: Classroom companion: Economics.Publisher: Cham : Springer, 2024Edition: 2nd ed.Description: xxiv, 766 p. ; ill., 25 cm.ISBN: 9783031600982.Subject(s): Econometrics | Economics, Mathematical | Game theoryDDC classification: 330.0151 Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books DAU
330.0151 ROT (Browse shelf) Available 035907

Includes bibliographical references and index.

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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha