|
This article is cited in 2 scientific papers (total in 2 papers)
A new equilibrium in cyclic games on graphs
V. N. Lebedev
Abstract:
We prove that there exists an equilibrium for stationary strategies in
cyclic games where the game on vertices of a graph lasts until
it reaches a cycle, and the payment of one player to the other equals
the sum of the maximal and minimal costs of the edges of this cycle.
Received: 13.10.1994
Citation:
V. N. Lebedev, “A new equilibrium in cyclic games on graphs”, Diskr. Mat., 9:4 (1997), 94–99; Discrete Math. Appl., 7:6 (1997), 637–642
Linking options:
https://www.mathnet.ru/eng/dm497https://doi.org/10.4213/dm497 https://www.mathnet.ru/eng/dm/v9/i4/p94
|
Statistics & downloads: |
Abstract page: | 413 | Full-text PDF : | 233 | First page: | 2 |
|