Algorithmic Game Theory

ISBN-10: 0521872820

ISBN-13: 9780521872829

Edition: 2007

List price: $67.00 Buy it from $62.00
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: With contributions from major researchers in the field, 'Algorithmic Game Theory' presents a comprehensive treatment of this important practical application.

New Starting from $66.30
eBooks Starting from $52.00
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $67.00
Copyright year: 2007
Publisher: Cambridge University Press
Publication date: 9/24/2007
Binding: Hardcover
Pages: 778
Size: 7.25" wide x 10.00" long x 2.00" tall
Weight: 3.630

Tim Roughgarden is Assistant Professor of Computer Science at Stanford University and recipient of the ACM's Grace Hopper Award.

Introduction
Computing in Games
Basic solution concepts and computational issues
Algorithms for equilibria
Equilibrium computation for games in strategic and extensive form
Learning, regret minimization and correlated equilibria
Graphical games
Cryptography and game theory
Combinatorial algorithms for market equilibria Vijay V. Vazirani
Computation of market equilibria by convex programming
Algorithmic Mechanism Design
Introduction to mechanism design (for computer scientists)
Mechanism design without money
Combinatorial auctions
Computationally efficient approximation mechanisms
Profit maximization in mechanism design
Distributed algorithmic mechanism design
Cost sharing
On-line mechanisms
Quantifying the Inefficiency of Equilibria
Introduction to the inefficiency of equillibria
Routing games
Inefficiency of equilibria in network formation games
Selfish load-balancing
Efficiency loss and the design of scalable resource allocation mechanisms
Additional Topics
Incentives and pricing in communication networks
Incentives in peer-to-peer systems
Cascading behavior in networks: algorithmic and economic issues
Incentives and information security
Computational aspects of information markets
Manipulation-resistant reputation systems
Sponsored search auctions
Algorithmic issues in evolutionary game theory
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×