Abstract
We built a time-consistent cooperative solution for the class of dynamic games played over event trees in the context where the tree structure is given, but the players have different beliefs about the transition probabilities between nodes. Our three-step approach is as follows. First, we consider three alternative methods for aggregating the players’ beliefs and assume that the players agree to adopt one of them if they decide to cooperate. Second, we determine the Nash bargaining outcomes for the whole duration of the game. Finally, to insure sustainability of cooperation throughout the whole duration of the game, we propose two time-consistent decompositions over nodes of each player’s cooperative share, namely a proportion-consistent and a node-consistent allocation schemes. We illustrate our results with a simple Cournot oligopoly with capacity constraints.



Similar content being viewed by others
Notes
In this paper, we do not consider imprecise probabilities and refer the interested reader to [31] for a discussion on their use in event trees.
We call the strategy \( S \)-adapted to highlight that at each period we have a Sample of events corresponding to the nodes.
We use term “belief aggregation” in Sect. 3 when describing the methods of aggregating probability distributions, whereas in the literature the term “opinion pooling” is used ([4, 26, 27]). To avoid confusion, we use the “opinion pooling” technique to aggregate players’ beliefs on transition probabilities but use the term “belief aggregation” to be in line with the theory of dynamic games with imperfect information.
Updating the weights may be considered only in the cases of linear and geometric belief aggregations. In multiplicative belief aggregation the weights are not used. The “calibrating” probability function plays the role of weights.
See [12] for a definition of the Nash bargaining solution.
In the considered problem, only the regular case is meaningful. Therefore, the non-regular case, when \(\nu _{0}=0\), is omitted here.
One can think of these additional properties as a refinement approach of the IDP.
References
Avrachenkov, K., Elias, J., Martignon, F., Neglia, G., Petrosyan, L.: Cooperative network design: a Nash bargaining solution approach. Comput. Netw. 83, 265–279 (2015)
Clemen, R.T., Winkler, R.L.: Combining probability distributions from experts in risk analysis. Risk Anal. 19(2), 187–203 (1999)
Dietrich, F.: Bayesian group belief. Soc. Choice Welf. 35(4), 595–626 (2010)
Dietrich, F., List, C.: Probabilistic opinion pooling. In: Hajek, A., Hitchcock, C. (eds.) Oxford Handbook of Probability and Philosophy. Oxford University Press, Oxford (2016)
French, S.: Group consensus probability distributions: a critical survey. In: Bernardo, D., DeGroot, M., Smith, A. (eds.) Bayesian Statistics: Proceedings of the Second Valencia International Meeting, pp. 183–201. North-Holland, Amsterdam (1985)
Genc, T., Reynolds, S., Sen, S.: Dynamic oligopolistic games under uncertainty: a stochastic programming approach. J. Econ. Dyn. Control 31, 55–80 (2007)
Genc, T., Sen, S.: An analysis of capacity and price trajectories for the Ontario electricity market using dynamic Nash equilibrium under uncertainty. Energy Econ. 30, 173–191 (2008)
Gromova, E., Plekhanova, T.: On the regularization of a cooperative solution in a multistage game with random time horizon. Discret. Appl. Math. 255, 40–55 (2019)
Haurie, A., Krawczyk, J.B., Zaccour, G.: Games and Dynamic Games. World Scientific, Singapore (2012)
Haurie, A., Zaccour, G., Smeers, Y.: Stochastic equilibrium programming for dynamic oligopolistic markets. J. Optim. Theory Appl. 66(2), 243–253 (1990)
Madansky, A.: Externally Bayesian Groups. RAND Corporation, RM-4141-PR, Santa Monica (1964)
Nash, J.: The bargaining problem. Econometrica 18(2), 155–162 (1950)
Ouchi, F.: A Literature Review on the Use of Expert Opinion in Probabilistic Risk Analysis. World Bank, Washington, DC (2004)
Parilina, E., Tampieri, A.: Stability and cooperative solution in stochastic games. Theor. Decis. 84, 601–625 (2018)
Parilina, E., Zaccour, G.: Approximated cooperative equilibria for games played over event trees. Oper. Res. Lett. 43(5), 507–513 (2015)
Parilina, E., Zaccour, G.: Node-consistent core for games played over event trees. Automatica 53, 304–311 (2015)
Parilina, E., Zaccour, G.: Strategic support of node-consistent cooperative outcomes in dynamic games played over event trees. Int. Game Theory Rev. 18(2), 1640002 (2016)
Parilina, E., Zaccour, G.: Node-consistent Shapley value for games played over event trees with random terminal time. J. Optim. Theory Appl. 175(1), 236–254 (2017)
Petrosyan, L.: Stable solutions of differential games with many participants. Viestnik Leningrad Univ. 19, 46–52 (1977)
Petrosyan, L., Danilov, N.A.: Time-consistent solutions of non-antagonistic differential games with transferable payoffs. Viestnik Leningrad Univ. 1, 46–54 (1979)
Petrosyan, L., Zaccour, G.: Cooperative differential games with transferable payoffs. In: Basar, T., Zaccour, G. (eds.) Handbook of Dynamic Game Theory, pp. 595–632. Springer, Cham (2018)
Pineau, P.O., Rasata, H., Zaccour, G.: Impact of some parameters on investments in oligopolistic electricity markets. Eur. J. Oper. Res. 213(1), 180–195 (2011)
Reddy, P.V., Shevkoplyas, E., Zaccour, G.: Time-consistent Shapley value for games played over event trees. Automatica 49(6), 1521–1527 (2013)
Reddy, P.V., Zaccour, G.: Open-loop and feedback Nash equilibria in constrained linear-quadratic dynamic games played over event trees. Automatica 107, 162–174 (2019)
Rosen, J.B.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica 33(3), 520–534 (1965)
Stewart, R.T., Quintana, I.O.: Probabilistic opinion pooling with imprecise probabilities. J. Philos. Log. 47, 17–45 (2018)
Stone, M.: The opinion pool. Ann. Math. Stat. 32(4), 1339–1342 (1961)
Yeung, D., Petrosyan, L.: Proportional time-consistent solutions in differential games. In: Contributions to the Theory of Games II, Annals of Mathematics Studies, pp. 254–256. Saint Petersburg (2001)
Yeung, D., Petrosyan, L.: Subgame Consistent Economic Optimization. Birkhauser, Boston (2012)
Yeung, D.W., Petrosyan, L.A.: Nontransferable utility cooperative dynamic games. In: Basar, T., Zaccour, G. (eds.) Handbook of Dynamic Game Theory, pp. 633–670. Springer, Cham (2018)
You, X., Tonon, F.: Event-tree analysis with imprecise probabilities. Risk Anal. 32(2), 331–344 (2012)
Zaccour, G.: Théorie des jeux et marchés énergétiques: marché européen de gaz naturel et échanges d’électricité, Ph.D. Thesis. HEC Montréal (1987)
Zaccour, G.: Time consistency in cooperative differential games: a tutorial. INFOR 46(1), 81–92 (2008)
Zaccour, G.: Sustainability of cooperation in dynamic games played over event trees. In: Roderick, R.M., Belair, J. (eds.) Recent Progress and Modern Challenges in Applied Mathematics, Modeling and Computational Science, Fields Institute Communications Series, pp. 419–437. Springer, Cham (2017)
Acknowledgements
We would like to thank the editor and the two anonymous reviewers for their helpful comments. This research was partially conducted during the research stay of the first author at GERAD. The work of the first author was supported by the Shandong Province “Double-Hundred Talent Plan” (No. WST2017009). The work of the second author is supported by NSERC, Canada, Grant RGPIN-2016-04975.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Felix L. Chernousko.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Parilina, E.M., Zaccour, G. Sustainable Cooperation in Dynamic Games on Event Trees with Players’ Asymmetric Beliefs. J Optim Theory Appl 194, 92–120 (2022). https://doi.org/10.1007/s10957-022-02010-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-022-02010-5
Keywords
- Stochastic games
- Event tree
- S-adapted strategies
- Asymmetric information
- Belief aggregation
- Nash bargaining solution