An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division Rothe, Jörg. editor. edt http://id.loc.gov/vocabulary/relators/edt SpringerLink (Online service) text sz 2024 2nd ed. 2024. monographic eng

electronic

electronic resource

access XXIV, 766 p. online resource. 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. 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. edited by Jörg Rothe. Econometrics Microeconomics Algorithms Mathematics Philosophy System theory Economics Quantitative Economics Microeconomics Design and Analysis of Algorithms Philosophy of Mathematics Complex Systems Political Economy and Economic Systems HB139-141 9783031600999 https://doi.org/10.1007/978-3-031-60099-9 https://doi.org/10.1007/978-3-031-60099-9 240629 20251030112341.0 978-3-031-60099-9