Abstract
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.
Publisher
Saint Petersburg State University
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stackelberg games with dynamic spanning trees;2023 35th Chinese Control and Decision Conference (CCDC);2023-05-20
2. Improved plant parenchyma extraction technology using artificial intelligence algorithms;Современные инновации, системы и технологии - Modern Innovations, Systems and Technologies;2022-12-12
3. Dynamic "optimistic" characteristic function in the game with spanning tree;2022 34th Chinese Control and Decision Conference (CCDC);2022-08-15