Selfish Routing and the Price of Anarchy

“Distributed competitive decision making, as opposed to centralized planning, is emerging as the norm in modern systems such as the Internet. The exciting area of algorithmic game theory, which combines methodology from two rich fields, attempts to identify and understand new issues arising as a consequence of this fact. This book provides a vivid glimpse into this area by dealing comprehensively with one of its well-studied problems.”–Vijay V. Vazirani, College of Computing, Georgia Institute of Technology
“In recent years we have seen a fascinating confluence of ideas from algorithmic computer science and game theory, chiefly in the service of advancing our understanding of the technological and sociological mystery that is the Internet. Nowhere is the excitement, novelty, power, and elegance of these new ideas exemplified better than in Tim Roughgarden’s doctoral dissertation, which is the basis for this important book.”–Christos Papadimitriou, C. Lester Hogan Professor of Computer Science, University of California, Berkeley
“Recent trends in the analysis and design of computer networks take into account rationally selfish behavior by the network’s different components. This book introduces this exciting interdisciplinary type of analysis and presents some of its clearest and most influential applications.”–Noam Nisan, School of Computer Science and Engineering, Hebrew University of Jerusalem
& quot; Distributed competitive decision making, as opposed to centralized planning, is emerging as the norm in modern systems such as the Internet. The exciting area of algorithmic game theory, which combines methodology from two rich fields, attempts to identify and understand new issues arising as a consequence of this fact. This book provides a vivid glimpse into this area by dealing comprehensively with one of its well-studied problems.& quot; –Vijay V. Vazirani, College of Computing, Georgia Institute of Technology
& quot; In recent years we have seen a fascinating confluence of ideas from algorithmic computer science and game theory, chiefly in the service of advancing our understanding of the technological and sociological mystery that is the Internet. Nowhere is the excitement, novelty, power, and elegance of these new ideas exemplified better than in Tim Roughgarden’s doctoral dissertation, which is the basis for this important book.& quot; –Christos Papadimitriou, C. Lester Hogan Professor of Computer Science, University of California, Berkeley
& quot; Recent trends in the analysis and design of computer networks take into account rationally selfish behavior by the network’s different components. This book introduces this exciting interdisciplinary type of analysis and presents some of its clearest and most influential applications.& quot; –Noam Nisan, School of Computer Science and Engineering, Hebrew University of Jerusalem
” Distributed competitive decision making, as opposed to centralized planning, is emerging as the norm in modern systems such as the Internet. The exciting area of algorithmic game theory, which combines methodology from two rich fields, attempts to identify and understand new issues arising as a consequence of this fact. This book provides a vivid glimpse into this area by dealing comprehensively with one of its well-studied problems.” –Vijay V. Vazirani, College of Computing, Georgia Institute of Technology
” In recent years we have seen a fascinating confluence of ideas from algorithmic computer science and game theory, chiefly in the service of advancing our understanding of the technological and sociological mystery that is the Internet. Nowhere is the excitement, novelty, power, and elegance of these new ideas exemplified better than in Tim Roughgarden’s doctoral dissertation, which is the basis for this important book.” –Christos Papadimitriou, C. Lester Hogan Professor of Computer Science, University of California, Berkeley
” Recent trends in the analysis and design of computer networks take into account rationally selfish behavior by the network’s different components. This book introduces this exciting interdisciplinary type of analysis and presents some of its clearest and most influential applications.” –Noam Nisan, School of Computer Science and Engineering, Hebrew University of Jerusalem
–Christos Papadimitriou, C. Lester Hogan Professor of Computer Science, University of California, Berkeley
–Noam Nisan, School of Computer Science and Engineering, Hebrew University of Jerusalem
–Vijay V. Vazirani, College of Computing, Georgia Institute of Technology

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

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.