Would you like to see this page in English? Click here.


または
1-Clickで注文する場合は、サインインをしてください。
または
Amazonプライム会員に適用。注文手続きの際にお申し込みください。詳細はこちら
こちらからも買えますよ
この商品をお持ちですか? マーケットプレイスに出品する
Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Intelligence and Machine Learning)
 
イメージを拡大
 

Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Intelligence and Machine Learning) [ペーパーバック]

Georgios Chalkiadakis , Edith Elkind , Michael Wooldridge

価格: ¥ 3,822 通常配送無料 詳細
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
在庫あり。 在庫状況について
この商品は、Amazon.co.jp が販売、発送します。 ギフトラッピングを利用できます。
2012/5/31 木曜日 にお届けします! 「お急ぎ便」オプション(有料)を選択して注文を確定された関東エリアへの配達のご注文が対象です。詳しくはこちら
1冊からでも印刷、お届け
オンデマンド印刷技術で注文に応じて印刷、お届けする「プリント・オン・デマンド(POD)」サービス。

キャンペーンおよび追加情報

  • 掲載画像とお届けする商品の表紙が異なる場合があります。ご了承ください。


商品の説明

内容説明

Cooperative game theory is a branch of (micro-)economics that studies the behavior of self-interested agents in strategic settings where binding agreements among agents are possible. Our aim in this book is to present a survey of work on the computational aspects of cooperative game theory. We begin by formally defining transferable utility games in characteristic function form, and introducing key solution concepts such as the core and the Shapley value. We then discuss two major issues that arise when considering such games from a computational perspective: identifying compact representations for games, and the closely related problem of efficiently computing solution concepts for games. We survey several formalisms for cooperative games that have been proposed in the literature, including, for example, cooperative games defined on networks, as well as general compact representation schemes such as MC-nets and skill games. As a detailed case study, we consider weighted voting games: a widely-used and practically important class of cooperative games that inherently have a natural compact representation. We investigate the complexity of solution concepts for such games, and generalizations of them.

We briefly discuss games with non-transferable utility and partition function games. We then overview algorithms for identifying welfare-maximizing coalition structures and methods used by rational agents to form coalitions (even under uncertainty), including bargaining algorithms. We conclude by considering some developing topics, applications, and future research directions.

Table of Contents: Introduction / Basic Concepts / Representations and Algorithms / Weighted Voting Games / Beyond Characteristic Function Games / Coalition Structure Formation / Advanced Topics

"This manuscript was a pleasure to discover, and a pleasure to read -- a broad, but succinct, overview of work in computational cooperative game theory. I will certainly use this text with my own students, both within courses and to provide comprehensive background for students in my research group. The authors have made a substantial contribution to the multiagent systems and algorithmic game theory communities." --Professor Jeffrey S. Rosenschein, The Hebrew University of Jerusalem, Israel

"With the advent of the internet, the computational aspects of cooperative game theory are ever more relevant. This unique and timely book by Chalkiadakis, Elkind, and Wooldridge gives a concise and comprehensive survey of the subject, and serves at the same time as a one-stop introduction to cooperative game theory." --Professor Bernhard von Stengel, London School of Economics, UK

"In recent years, research on the computational aspects of cooperative game theory has made tremendous progress, but previous textbooks have not included more than a short introduction to this important topic. I am excited by the thorough treatment in this new book, whose authors have been and continue to be at the very forefront of this research. Newcomers to the area are well advised to read this book carefully and cover to cover." --Professor Vincent Conitzer, Duke University, USA

"Cooperative game theory has proved to be a fertile source of challenges and inspiration for computer scientists. This book will be an essential companion for everyone wanting to explore the computational aspects of cooperative game theory." --Prof Makoto Yokoo, Kyushu University, Japan

"An excellent treatise on algorithms and complexity for cooperative games. It navigates through the maze of cooperative solution concepts to the very frontiers of algorithmic game theory research.The last chapter in particular will be enormously valuable for graduate students and young researchers looking for research topics." --Professor Xiaotie Deng, University of Liverpool, UK


登録情報


この商品にタグをつける

 (詳細)
タグは、商品との関連性が非常に強いキーワードまたはラベルのようなものです。
タグにより、すべてのお客様がお気に入りの商品の整理と確認を行うことができます。
※タグは初期設定で公開になっています。詳しくはこちら
 

カスタマーレビュー

Amazon.co.jp にはまだカスタマーレビューはありません
星5つ
星4つ
星3つ
星2つ
星1つ
Amazon.com で最も参考になったカスタマーレビュー (beta)
Amazon.com:  1個のレビュー
good book 2012/5/8
By Park Kun Su - (Amazon.com)
形式:ペーパーバック|Amazonが確認した購入
This book is very useful to study game theory, especially cooperative game.
I strongly recommend it.
It is worth reading in detail.

クチコミ

クチコミは、商品やカテゴリー、トピックについて他のお客様と語り合う場です。お買いものに役立つ情報交換ができます。
この商品のクチコミ一覧
内容・タイトル 返答 最新の投稿
まだクチコミはありません

複数のお客様との意見交換を通じて、お買い物にお役立てください。
新しいクチコミを作成する
タイトル:
最初の投稿:
サインインが必要です
 

クチコミを検索
すべてのクチコミを検索
   


リストマニア

リストを作成

関連商品を探す


同じキーワードの商品を探す


フィードバック


Amazon.co.jpのプライバシー ステートメント Amazon.co.jpの発送情報 Amazon.co.jpでの返品と交換