|
Matematicheskaya Teoriya Igr i Ee Prilozheniya, 2009, Volume 1, Issue 2, Pages 66–81
(Mi mgta9)
|
|
|
|
This article is cited in 27 scientific papers (total in 27 papers)
Multistage networking games with full information
Leon Petrosjan, Artem Sedakov Faculty of Applied Mathematics and Control Processes, Saint-Peterburg State University
Abstract:
Multistage networking games with full information are considered. The network structure which connects the players is defined at every time moment. We assume that each verge has a utility (the player's profit form the connection with another player), and players have a right to change network structure at every stage. The approach to define optimal players' behavior is proposed.
Keywords:
network, networking games, utility, Shapley value, Nash equilibrium.
Citation:
Leon Petrosjan, Artem Sedakov, “Multistage networking games with full information”, Mat. Teor. Igr Pril., 1:2 (2009), 66–81; Autom. Remote Control, 75:8 (2014), 1532–1540
Linking options:
https://www.mathnet.ru/eng/mgta9 https://www.mathnet.ru/eng/mgta/v1/i2/p66
|
Statistics & downloads: |
Abstract page: | 671 | Full-text PDF : | 273 | References: | 71 | First page: | 1 |
|