|
|
|
|
| LEADER |
02621nmm a2200385 u 4500 |
| 001 |
EB002219133 |
| 003 |
EBX01000000000000001356094 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
240702 ||| eng |
| 020 |
|
|
|a 9783031600999
|
| 100 |
1 |
|
|a Rothe, Jörg
|e [editor]
|
| 245 |
0 |
0 |
|a Economics and Computation
|h Elektronische Ressource
|b An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division
|c edited by Jörg Rothe
|
| 250 |
|
|
|a 2nd ed. 2024
|
| 260 |
|
|
|a Cham
|b Springer Nature Switzerland
|c 2024, 2024
|
| 300 |
|
|
|a XXIV, 766 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Mathematics / Philosophy
|
| 653 |
|
|
|a Economics
|
| 653 |
|
|
|a Microeconomics
|
| 653 |
|
|
|a Complex Systems
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Political Economy and Economic Systems
|
| 653 |
|
|
|a Design and Analysis of Algorithms
|
| 653 |
|
|
|a System theory
|
| 653 |
|
|
|a Quantitative Economics
|
| 653 |
|
|
|a Philosophy of Mathematics
|
| 653 |
|
|
|a Econometrics
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Classroom Companion: Economics
|
| 028 |
5 |
0 |
|a 10.1007/978-3-031-60099-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-031-60099-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 330.9
|
| 520 |
|
|
|a 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
|