Zobrazeno 1 - 10
of 21
pro vyhledávání: '"V. S. Levchenkov"'
Autor:
V. S. Levchenkov
Publikováno v:
Doklady Mathematics. 81:493-496
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dbb1274586e690efb298b4cbe2db9be
https://doi.org/10.1134/s1064562410030439
https://doi.org/10.1134/s1064562410030439
Autor:
V. S. Levchenkov
Publikováno v:
Doklady Mathematics. 81:332-335
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::daaeb0b202a4523dca32672af8c8ba01
https://doi.org/10.1134/s1064562410020468
https://doi.org/10.1134/s1064562410020468
Autor:
L. G. Levchenkova, V. S. Levchenkov
Publikováno v:
Computational Mathematics and Modeling. 20:416-426
The issue of estimating the voter power in weighted voting systems is considered. We show that the numerical values of the weighted power index previously introduced by the author can be determined by a simple minimization scheme. The efficiency of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88d380f0b3d43fa2a40f19a846487df6
https://doi.org/10.1007/s10598-009-9047-9
https://doi.org/10.1007/s10598-009-9047-9
Autor:
L. G. Levchenkova, V. S. Levchenkov
Publikováno v:
Computational Mathematics and Modeling. 19:217-229
A new quantitative definition of the “power index” is proposed for a voter in weighted voting systems (WV-schemes), where the voters a priori do not have equal rights. The proposed “power index” is generated in a self-consistent manner from i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc853a4d526fceff43962709699c6dad
https://doi.org/10.1007/s10598-008-0015-6
https://doi.org/10.1007/s10598-008-0015-6
Autor:
V. S. Levchenkov
Publikováno v:
Computational Mathematics and Modeling. 19:102-115
A new approach to the solution of one-step games is constructed, without using the concept of mixed strategy. The notion of a “set” solution of a bimatrix game is defined. It is shown that this solution always exists and may be found by a finite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::befd94106eb51d92d988e17b70cc864a
https://doi.org/10.1007/s10598-008-0008-5
https://doi.org/10.1007/s10598-008-0008-5
Autor:
V. S. Levchenkov
Publikováno v:
Computational Mathematics and Modeling. 18:203-215
A new approach to the construction of utility under uncertainty is proposed. The approach relies on a binary relation on the set of outcomes of a probabilistic process. Kingman’s subadditive ergodic theorem is applied to prove the existence of a ut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eca388b7cc8b8d8769a53511942df967
https://doi.org/10.1007/s10598-007-0020-1
https://doi.org/10.1007/s10598-007-0020-1
Autor:
V. S. Levchenkov, L. G. Levchenkova
Publikováno v:
Computational Mathematics and Modeling. 18:42-54
Methods of symbolic dynamics are applied to construct a description of two-person supergames, i.e., games involving infinite repetition of the same basis matrix game. The behavior of players choosing their moves based only on information about the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::270da79b8f590dd1d8058fbf231f9c26
https://doi.org/10.1007/s10598-007-0005-0
https://doi.org/10.1007/s10598-007-0005-0
Autor:
V. S. Levchenkov, L. G. Levchenkova
Publikováno v:
Computational Mathematics and Modeling. 17:354-363
The article examines the solution of bargaining games on the basis of the previously proposed paradigm of stationary strategies in supergames. The value of axiomatic bargaining theory for choosing the unique solution in agreement games is considered.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::279134cdabda95f87cc09218785bcafa
https://doi.org/10.1007/s10598-006-0029-x
https://doi.org/10.1007/s10598-006-0029-x
Autor:
L. G. Levchenkova, V. S. Levchenkov
Publikováno v:
Computational Mathematics and Modeling. 17:254-273
The dynamic approach developed for the description of supergames is applied to problems in the theory of cooperation. New methods are proposed to describe game programs both in the standard prisoner’s dilemma format and in the nonstandard format al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b49629eaf9d3ade7e8f9574ffb9baf69
https://doi.org/10.1007/s10598-006-0022-4
https://doi.org/10.1007/s10598-006-0022-4
Autor:
V. S. Levchenkov, L. G. Levchenkova
Publikováno v:
Computational Mathematics and Modeling. 17:88-96
The multirelation method originally developed for group choice problems is applied to study the formation of new links in a social network graph. A natural generalization of the “nearest neighbor” method is proposed for predicting the appearance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1536afa476aaee123ddcdc45927b555e
https://doi.org/10.1007/s10598-006-0015-3
https://doi.org/10.1007/s10598-006-0015-3