Zobrazeno 1 - 10
of 10
pro vyhledávání: '"V. Shevkoplyas"'
Autor:
V. Shevkoplyas, F. Vasilevich
Publikováno v:
Veterinaria i kormlenie. :25-28
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8a6381ff9fdeae5754443bcab27bd36
https://doi.org/10.30917/att-vk-1814-9588-2018-2-6
https://doi.org/10.30917/att-vk-1814-9588-2018-2-6
Publikováno v:
Fuel. 184:314-324
In order to foster an effective utilization of the high-sulfur coal reserves and promote a wide implementation of coal-to-liquid technologies, the behavior of two low rank bituminous coals with different genetic type by reductivity during mild pyroly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f95437fc16b40fd042752ee3fcbc8a2
https://doi.org/10.1016/j.fuel.2016.07.005
https://doi.org/10.1016/j.fuel.2016.07.005
Autor:
E. V. Shevkoplyas
Publikováno v:
Journal of Mathematical Sciences. 199:715-722
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::586df542b31e66d8fa6cf8d9d3ad23ab
https://doi.org/10.1007/s10958-014-1897-9
https://doi.org/10.1007/s10958-014-1897-9
Autor:
E. V. Shevkoplyas
Publikováno v:
Automation and Remote Control. 75:959-970
We consider the class of differential games with random duration. We show that a problem with random game duration can be reduced to a standard problem with an infinite time horizon. A Hamilton-Jacobi-Bellman-type equation is derived for finding opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6b76a11d7ea81f0a1a2b126ade8feac
https://doi.org/10.1134/s0005117914050142
https://doi.org/10.1134/s0005117914050142
Publikováno v:
Automatica. 49:1521-1527
In this paper, we provide a decomposition over time of Shapley value for dynamic stochastic discrete-time games, where the uncertainty is described by an event tree. We show that the suggested dynamic allocation is time consistent, that is, along the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ea1f1efa25d1aeb88bc8d725101be1d
https://doi.org/10.1016/j.automatica.2013.02.029
https://doi.org/10.1016/j.automatica.2013.02.029
Publikováno v:
Automatica. 47:2626-2638
Previous results on non-constant discounting in continuous time are extended to the field of deterministic differential games with a stochastic terminal time. A dynamic programming equation is derived for problems with general time inconsistent prefe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca0cb78c711c6d4503221355c588cc0b
https://doi.org/10.1016/j.automatica.2011.09.010
https://doi.org/10.1016/j.automatica.2011.09.010
Autor:
Ekaterina V. Shevkoplyas
Publikováno v:
Annals of the International Society of Dynamic Games ISBN: 9780817680886
The class of cooperative differential games with random duration is studied in this chapter. The problem of the Shapley Value calculation is examined. As a result, the Hamilton–Jacobi–Bellman equation for the problem with random duration is deriv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68a3ff6e73dd1a5a0606ee70216ca084
https://doi.org/10.1007/978-0-8176-8089-3_18
https://doi.org/10.1007/978-0-8176-8089-3_18
Publikováno v:
International Game Theory Review. 16:1450005
We formulate an overlapping generations model on optimal emissions with continuous age structure. We compare the noncooperative solution to the cooperative one and obtain fundamental differences in the optimal strategies. Also including an altruistic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::971c98008aa6994773f6cabced9afbee
https://doi.org/10.1142/s0219198914500054
https://doi.org/10.1142/s0219198914500054
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.