title: The dynamic Nash bargaining solution for 2-stage cost sharing game
metadata.name: dc.contributor.author
metadata.value: Li, Yin
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2020-11-19T09:45:52Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2020-11-19T09:45:52Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2020-09-01
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/20702
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The problem of constructing the Dynamic Nash Bargaining Solution in a 2-stage game is studied. In each stage, a minimum cost spanning tree game is played, all players select strategy profiles to construct graphs in the stage game. At the second stage, players may change the graph using strategy profiles with transition probabilities, which decided by players in the first stage. The players' cooperative behavior is considered. As solution the Dynamic Nash Bargaining Solution is proposed. A theorem is proved to allow the Dynamic Nash Bargaining Solution to be time-consistent.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St. Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Contributions to Game Theory and Management, vol. XIII, 296–303;
metadata.lang: -
metadata.name: dc.title
metadata.value: The dynamic Nash bargaining solution for 2-stage cost sharing game
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: Li(296-303).pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/20702/1/Li%28296-303%29.pdf
resources.format: Adobe PDF
resources.size: 341,98 kB