株式会社極東書店トップ > 商品一覧 > Credible Threats in Negotiations : A Game-theoretic Approach.
商品詳細
Credible Threats in Negotiations : A Game-theoretic Approach.
・ISBN 978-1-4020-7183-6 hard EUR 149.99
¥40,091.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Houba, Harold / Bolt, W., |
|---|---|
| シリーズ | Theory and Decision Library C: Game Theory, Mathematical Programming and Operations Research |
| 出版社 | (Kluwer Academic, NE) |
| 出版年月 | 2002 |
| ページ数 | 320 pp. |
| 言語 | ENG |
| ニュース番号 | <493-181 498-210> |
解説
The game-theoretic modelling of negotiations has been an active research area for the past five decades, that started with the seminal work by Nobel laureate John Nash in the early 1950s. This book provides a survey of some of the major developments in the field of strategic bargaining models with an emphasize on the role of threats in the negotiation process. Threats are all actions outside the negotiation room that negotiators have ate their disposal and the use of these actions affect the bargaining position of all negotiators. Of course, each negotiator aims to strengthen his own position. Examples of threats are the announcement of a strike by a union in centralized wage bargaining, or a nation's announcement of a trade war directed against other nations in negotiations for trade liberalization. This book is organized on the basis of a simple guiding principle: The situation in which none of the parties involved in the negotiations has threats at its disposal is the natural benchmark for negotiations where the parties can make threats. Also on the technical level, negotiations with variable threats build on and extend the techniques applied in analyzing bargaining situations without threats. The first part of this book, containing chapter 3-6, presents the no-threat case, and the second part, containing chapter 7-10, extends the analysis for negotiation situations where threats are present. A consistent and unifying framework is provided first in 2.