並列タイトル等Application of Game Theory to Negotiation Problems
一般注記In this dissertation, we pay a particular attention to the application of game theory in three multi-agent negotiation problems: minimum cost spanning tree, data envelopment analysis (DEA), and partner selection in airline alliances, where the first two problems assume for an abstract agent. In Chapter 2, we characterize the decentralized rule in the minimum cost spanning tree problem, which is introduced by Feltkamp et al. [1994b]. In Chapter 3, we first improve the DEA game in Nakabayashi and Tone [2006] by proposing an alternative scheme and then focus on analyzing the solutions by our new game theoretic approaches to weight assignments in DEA problems. Lastly, the main concern in Chapter 4 is how the service quality might affect an airline’s decision making in the selection of its partner during the formation of airline alliances.
identifier:oai:t2r2.star.titech.ac.jp:50230773
一次資料へのリンクURLhttp://t2r2.star.titech.ac.jp/rrws/file/CTT100666709/ATD100000413/thesis.pdf (fulltext)
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース(IRDB)(機関リポジトリ)