Custom cover image
Custom cover image

Economics and Computation : An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division / edited by Jörg Rothe ; illustrations by Irene Rothe

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Classroom Companion: EconomicsPublisher: Cham : Springer Nature Switzerland, 2024Publisher: Cham : Imprint: Springer, 2024Edition: Second editionDescription: 1 Online-Ressource (XXIV, 766 p.)ISBN:
  • 9783031600999
Uniform titles:
  • Einführung in Computational Social Choice
Subject(s): Genre/Form: Additional physical formats: 9783031600982 | 9783031601002 | 9783031601019 | Erscheint auch als: 9783031600982 Druck-Ausgabe | Erscheint auch als: 9783031601002 Druck-Ausgabe | Erscheint auch als: 9783031601019 Druck-Ausgabe | Erscheint auch als: Economics and computation. Druck-Ausgabe. Second edition. Cham : Springer Nature Switzerland, 2024. xxiv, 766 SeitenDDC classification:
  • 330.9 23
RVK: RVK: QC 160 | QH 435 | QH 500 | ST 610 | QC 020DOI: DOI: 10.1007/978-3-031-60099-9Online resources: Summary: 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.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.PPN: PPN: 1893106985Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-ECF | ZDB-2-SXEF
No physical items for this record
KIT – The Research University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT