Free Delivery Over $100
|
|
|||
|
||||
Overview"This monograph comprises a series of ten lectures divided into two parts. Part 1, referred to as the Solar Lectures, focuses on the communication and computational complexity of computing an (approximate) Nash equilibrium. Part 2, the Lunar Lectures, focuses on applications of computational complexity theory to game theory and economics. The goal of this short-course is twofold: (i) to explain how complexity theory has helped illuminate several barriers in economics and game theory, and (ii) to illustrate how game-theoretic questions have led to new and interesting complexity theory, including several very recent breakthroughs. While the solar lectures build on each other to some extent, the lunar lectures are episodic and can be read independently of each other. Most of the lunar lectures have the flavor of ""applied complexity theory"" and are less technically intense.Written in a relaxed style, the author uses his didactic expertise to guide the reader through the theory in an insightful and enjoyable manner. No background in game theory is assumed, making the whole text informative and accessible to a wide audience. This monograph gives the reader an excellent introduction to the basics of the subject and highlights some of the most recent breakthroughs in research. It provides the reader with a launch pad for further research." Full Product DetailsAuthor: Tim RoughgardenPublisher: now publishers Inc Imprint: now publishers Inc Weight: 0.294kg ISBN: 9781680836547ISBN 10: 1680836544 Pages: 204 Publication Date: 04 March 2020 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1. Introduction, Wish List, and Two-Player Zero-Sum Games 2. Communication Complexity Lower Bound for Computing an Approximate Nash Equilibrium of a Bimatrix Game (Part I) 3. Communication Complexity Lower Bound for Computing an Approximate Nash Equilibrium of a Bimatrix Game (Part II) 4. TFNP, PPAD, & All That 5. The Computational Complexity of Computing an Approximate Nash Equilibrium 6. How Computer Science Has Influenced Real-World Auction Design. Case Study: The 2016-2017 FCC Incentive Auction 7. Communication Barriers to Near-Optimal Equilibria 8. Why Prices Need Algorithms 9. The Borders of Border's Theorem 10. Tractable Relaxations of Nash Equilibria ReferencesReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
