Twenty Lectures on Algorithmic Game Theory (Paperback)

<內容簡介>

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

>Short, focused chapters allow readers to quickly learn the essentials of the topics most relevant to them
>Includes real-world case studies on a variety of topics including online advertising, wireless spectrum auctions, kidney exchange, and network management
<章節目錄>

1. Introduction and examples
2. Mechanism design basics
3. Myerson's Lemma
4. Algorithmic mechanism design 34
5. Revenue-maximizing auctions
6. Simple near-optimal auctions
7. Multi-parameter mechanism design
8. Spectrum auctions
9. Mechanism design with payment constraints
10. Kidney exchange and stable matching
11. Selfish routing and the price of anarchy
12. Network over-provisioning and atomic selfish routing
13. Equilibria: definitions, examples, and existence
14. Robust price-of-anarchy bounds in smooth games
15. Best-case and strong Nash equilibria
16. Best-response dynamics
17. No-regret dynamics
18. Swap regret and the Minimax theorem
19. Pure Nash equilibria and PLS-completeness
20. Mixed Nash equilibria and PPAD-completeness.

《演算法博弈理論導論》

內容簡介：
計算機科學和經濟學在過去的十五年中進行了活躍的互動，從而形成了新興領域——演算法博弈理論。現代計算機科學中許多核心問題，從大型網絡中的資源分配到在線廣告，都涉及多個自利方之間的互動。經濟學和博弈理論提供了許多有用的模型和定義，用於思考這些問題。思想的流動也朝著另一個方向發展，計算機科學的概念在經濟學中越來越重要。本書源於作者在斯坦福大學開設的演算法博弈理論課程，旨在為學生和其他新手提供一個快速且易於理解的介紹，涵蓋了該領域中最重要的概念。本書還包括在線廣告、無線頻譜拍賣、腎臟交換和網絡管理等案例研究。

章節目錄：
1. 簡介和例子
2. 機制設計基礎
3. 邁爾森引理
4. 演算法機制設計
5. 最大化收益的拍賣
6. 簡單近似最優拍賣
7. 多參數機制設計
8. 頻譜拍賣
9. 帶有支付限制的機制設計
10. 腎臟交換和穩定配對
11. 自私路由和無序的代價
12. 網絡超供應和原子自私路由
13. 平衡：定義、例子和存在性
14. 平滑遊戲中的強韌代價
15. 最佳情況和強納什均衡
16. 最佳反應動力學
17. 無悔動力學
18. 交換後悔和極小極大定理
19. 純納什均衡和PLS完全性
20. 混合納什均衡和PPAD完全性。