Results 241 to 250 of about 108,415 (292)
The application of artificial intelligence techniques in predicting game outcomes of professional basketball league: A systematic review. [PDF]
Li C, Zhang H, Zhang Y, Shen J, An R.
europepmc +1 more source
Warming Up for Basketball: Comparing Traditional vs. Small-Sided Game Approaches in Youth Players. [PDF]
Sansone P +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Systems Science and Cybernetics, 1968
The collective behavior of finite state stochastic automata is considered, which is of interest in view of the possibility of modeling group behavior of subjects in terms of these automata. The natural language for considering the collective behavior is that of game theory. After a brief introduction to a class of deterministic automata, the stochastic
Chandrasekaran, B., Shen, D. W. C.
openaire +1 more source
The collective behavior of finite state stochastic automata is considered, which is of interest in view of the possibility of modeling group behavior of subjects in terms of these automata. The natural language for considering the collective behavior is that of game theory. After a brief introduction to a class of deterministic automata, the stochastic
Chandrasekaran, B., Shen, D. W. C.
openaire +1 more source
Acta Informatica, 2007
This paper introduces a temporal logic, referred to as stochastic game logic (SGL), for finite-state probabilistic turn-based multi-player games. The logic is a probabilistic variant of alternating-time temporal logic (ATL) and incorporates elements of probabilistic computation tree logic (PCTL) as well as the possibility to describe path properties by
Baier, Christel +3 more
openaire +2 more sources
This paper introduces a temporal logic, referred to as stochastic game logic (SGL), for finite-state probabilistic turn-based multi-player games. The logic is a probabilistic variant of alternating-time temporal logic (ATL) and incorporates elements of probabilistic computation tree logic (PCTL) as well as the possibility to describe path properties by
Baier, Christel +3 more
openaire +2 more sources
Proceedings of the National Academy of Sciences, 1953
Es wird eine weitgehende Verallgemeinerung des (2-Personen-0-Summen-)Matrixspieles behandelt. \(N\) Positionen \(1,\dots ,N\) durchlaufen zwei Spieler \(A,B\) in der folgenden Weise: In der Position \(k\) wählen \(A\) und \(B\) unabhängig voneinander je eine natürliche Zahl \(i\) bzw. \(j\), \(1\leq i\leq m_k, 1\leq j\leq n_k\).
openaire +3 more sources
Es wird eine weitgehende Verallgemeinerung des (2-Personen-0-Summen-)Matrixspieles behandelt. \(N\) Positionen \(1,\dots ,N\) durchlaufen zwei Spieler \(A,B\) in der folgenden Weise: In der Position \(k\) wählen \(A\) und \(B\) unabhängig voneinander je eine natürliche Zahl \(i\) bzw. \(j\), \(1\leq i\leq m_k, 1\leq j\leq n_k\).
openaire +3 more sources
Journal of Optimization Theory and Applications, 1971
In this paper, we consider positive stochastic games, when the state and action spaces are all infinite. We prove that, under certain conditions, the positive stochastic game has a value and that the maximizing player has an e-optimal stationary strategy and the minimizing player has an optimal stationary strategy.
Maitra, A., Parthasarathy, T.
openaire +1 more source
In this paper, we consider positive stochastic games, when the state and action spaces are all infinite. We prove that, under certain conditions, the positive stochastic game has a value and that the maximizing player has an e-optimal stationary strategy and the minimizing player has an optimal stationary strategy.
Maitra, A., Parthasarathy, T.
openaire +1 more source
STOCHASTIC DESCRIPTOR PURSUITE GAME
Kibernetyka ta Systemnyi AnalizA differential pursuit game in a stochastic descriptor linear system is analyzed. The system dynamics is described by Ito’s stochastic differential algebraic equation. Solutions of the equation are presented by the formula of variation of constants in terms of the initial data and control unit. Constraints on the support functionals of two sets defined
Vlasenko, L. A. +3 more
openaire +2 more sources
Continuous-time stochastic games [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
IEEE Transactions on Systems, Man, and Cybernetics, 1974
The collective behavior of variable-structure stochastic automata in competitive game situations is investigated. It is demonstrated that when the automata use optimal or ?-optimal reinforcement schemes, the Von Neumann value is achieved for games against nature as well as for two-player zero-sum games having a saddle point. Computer simulations of the
Viswanathan, R., Narendra, Kumpati S.
openaire +2 more sources
The collective behavior of variable-structure stochastic automata in competitive game situations is investigated. It is demonstrated that when the automata use optimal or ?-optimal reinforcement schemes, the Von Neumann value is achieved for games against nature as well as for two-player zero-sum games having a saddle point. Computer simulations of the
Viswanathan, R., Narendra, Kumpati S.
openaire +2 more sources
On Terminating Stochastic Games
Management Science, 1970This paper describes a stochastic game in which the play terminates in a finite number of steps with probability 1. The game is called a terminating stochastic game. When the play terminates at any step, the play is regarded to reach to an absorbing state in the Markov chain under consideration.
H. Mine, K. Yamada, S. Osaki
openaire +1 more source

