Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Shravan Luckraz"'
Publikováno v:
AIMS Mathematics, Vol 8, Iss 3, Pp 6581-6589 (2023)
We study a simple motion differential game with many pursuers and one evader with equal capabilities in $ \mathbb{R}^n $. The control functions of the players are subject to the Grönwall-type constraints. If the state of the evader coincides with th
Externí odkaz:
https://doaj.org/article/5a6972b3ab5b44fdaa2dc063a8478ee9
Autor:
Shravan Luckraz
Publikováno v:
AIMS Mathematics, Vol 7, Iss 6, Pp 9976-9988 (2022)
We consider two well-known mathematical representations of informational structures in game theory. The first is based on the set of historical sequences of information encountered in the game while the second is given by the informational digraph of
Externí odkaz:
https://doaj.org/article/088c05b7c9c5465cbed389c46be76e3b
Autor:
Shravan Luckraz
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
While the assumption of infinity is prevalent in almost every area of economics, for two well-known frameworks in decision theory, we note some fundamental differences between the finite versions and their infinite counterpart. The first is on the us
Externí odkaz:
https://doaj.org/article/c649b1307d2b426783da5484f5ba0d08
Autor:
Shravan Luckraz
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
We propose a new fixed point theorem that completely characterizes the existence of fixed points for multivalued maps on finite sets. Our result can be seen as a generalization of Abian’s fixed point theorem. In the context of finite games, our res
Externí odkaz:
https://doaj.org/article/81456a5e76c74a479820aad4a14eba88
Publikováno v:
Mathematics, Vol 10, Iss 22, p 4367 (2022)
The game of pursuit and evasion, when played on graphs, is often referred to as the game of cops and robbers. This classical version of the game has been completely solved by Nowakowski and Winkler, who gave the exact class of graphs for which the pu
Externí odkaz:
https://doaj.org/article/82434015f4ff44e6ac74883b8d7ccf72
Autor:
Shravan Luckraz, Bruno Antonio Pansera
Publikováno v:
Mathematics, Vol 10, Iss 8, p 1212 (2022)
Using the concept of informational digraphs, we propose a “no redundant information sets” property that can characterize the exact class of extensive games which can be time structured. Our result can be applied to define time-dependent solution
Externí odkaz:
https://doaj.org/article/0298c92acaae46e5bfa0f848a17386dd
Publikováno v:
Journal of Optimization Theory and Applications. 196:1093-1105
Publikováno v:
Mathematics; Volume 10; Issue 22; Pages: 4367
The game of pursuit and evasion, when played on graphs, is often referred to as the game of cops and robbers. This classical version of the game has been completely solved by Nowakowski and Winkler, who gave the exact class of graphs for which the pu
Autor:
Shravan Luckraz
Publikováno v:
Journal of Computational and Applied Mathematics. 423:114992
Publikováno v:
SSRN Electronic Journal.