menu
{ "item_title" : "Economics and Computation", "item_author" : [" Jörg Rothe", "Irene Rothe "], "item_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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/66/251/044/3662510448_b.jpg", "price_data" : { "retail_price" : "99.99", "online_price" : "99.99", "our_price" : "99.99", "club_price" : "99.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Economics and Computation|Jörg Rothe

Economics and Computation : An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783662510445
  • ISBN-10: 3662510448
  • Publisher: Springer
  • Publish Date: August 2016
  • Dimensions: 9.21 x 6.14 x 1.27 inches
  • Shipping Weight: 1.91 pounds
  • Page Count: 612

Related Categories

You May Also Like...

    1

BAM Customer Reviews