カゴの中を見る

商品数:0点

合計:0円

カゴの中を見る

商品を探す

商品カテゴリから選ぶ

商品名を入力

検索結果で出ない商品は

お問い合わせ下さいませ

商品カテゴリ

分野別

商品コード: 9781680836554

Complexity Theory, Game Theory, and Economics

販売価格(税込10%): 33,880 円
種類別の販売価格、在庫状況を見る
装丁
数  量

カゴに入れる

商品おすすめポイント

書名

Complexity Theory, Game Theory, and Economics: The Barbados Lectures
シリーズ名 Foundations and Trends in Theoretical Computer Science (Vol. 14, Issue 3-4)
著者・編者 Roughgarden, T.
出版社/発行元 Now publishers
発行年/月 2020年3月   
装丁 電子ブック
ページ数/巻数

204 ページ

ISBN 978-1-68083-655-4

 


※冊子体の取り扱いもございます。ご希望のお客様は別途お問い合わせ下さい。

 

 

Description

 

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.

 

Contents:

 

1. 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
References

 

 

種類別の販売価格、在庫状況を見る
装丁
数  量

カゴに入れる

この商品に対するお客様の声

 

 

mitsumori

見積書をお送り致します

 

 

  新刊案内など配信中!!

 

このページのTOPへ