Economics and Computation
An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division
Series: Springer Texts in Business and Economics;
- Publisher's listprice EUR 90.94
-
37 717 Ft (35 921 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 7 543 Ft off)
- Discounted price 30 174 Ft (28 737 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
37 717 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2016
- Publisher Springer Berlin Heidelberg
- Date of Publication 23 August 2016
- Number of Volumes 1 pieces, Previously published in hardcover
- ISBN 9783662510445
- Binding Paperback
- See also 9783662479032
- No. of pages612 pages
- Size 235x155 mm
- Weight 9358 g
- Language English
- Illustrations XIII, 612 p. 123 illus., 9 illus. in color. Illustrations, black & white 0
Categories
Long description:
"
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.
" MoreTable of Contents:
Playing, Voting, and Dividing.- Part I Playing Successfully.- Noncooperative Game Theory.- Cooperative Game Theory.- Part II Voting and Judging.- Preference Aggregation by Voting.- The Complexity of Manipulative Actions in Single-Peaked Societies.- Judgement Aggregation.- Part III Fair Division.- Cake-Cutting: Fair Division of Divisible Goods.- Fair Division of Indivisible Goods.
More
Group Representations, Ergodic Theory, Operator Algebras, and Mathematical Physics: Proceedings of a Conference in Honor of George W. Mackey
53 249 HUF
46 860 HUF
