Algorithmic Game Theory, Braess's Paradox and the Price of Anarchy in Traffic and Attention Networks: chapter answers

Why can building one more road make everyone slower? This book uses algorithmic game theory to examine the gap between selfish choices and the collective optimum: where it comes from, how large it can be, what prices or rules can close it, and in what form the same structure appears in attention markets, recommender systems and matching markets. It covers Wardrop's user equilibrium and system optimum; Braess's diamond network, in which a zero-delay shortcut raises travel time from 1.5 to 2.0 (the shortcut is weakly, not strictly, dominant, and the paradox appears only for demand between 2/3 a…

DOI 10.5281/zenodo.23782094 · Read the monograph · 中文版

Illustrative model calculation, not a live quote