Results 221 to 230 of about 10,494 (264)
Some of the next articles are maybe not open access.
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
B. Chandrasekaran 0001, David W. C. Shen
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
B. Chandrasekaran 0001, David W. C. Shen
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
R. Viswanathan 0001, Kumpati S. Narendra
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
R. Viswanathan 0001, Kumpati S. Narendra
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
Games and Economic Behavior, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lukasz Balbus +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lukasz Balbus +2 more
openaire +1 more source
On Nonterminating Stochastic Games
Management Science, 1966A stochastic game is played in a sequence of steps; at each step the play is said to be in some state i, chosen from a finite collection of states. If the play is in state i, the first player chooses move k and the second player chooses move l, then the first player receives a reward akli, and, with probability pklij, the next state is j. The concept
A. J. Hoffman, R. M. Karp
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
Algorithms for stochastic games ? A survey
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1991Summary: We consider finite state, finite action, stochastic games over an infinite time horizon. We survey algorithms for the computation of minimax optimal stationary strategies in the zero-sum case, and of Nash equilibria in stationary strategies in the non-zero-sum case.
T. E. S. Raghavan, Jerzy A. Filar
openaire +3 more sources
SIAM Journal on Applied Mathematics, 1978
An object is hidden at a point e on the segment $[ {a,b} )$. A searcher tries to locate it by choosing points $x_i $ and asking: Is egreater than $x_i $ ?There is a positive probability of obtaining a wrong answer to these questions. The searcher wishes to locate the object in the smallest set possible in spite of the fact that some of the information ...
openaire +1 more source
An object is hidden at a point e on the segment $[ {a,b} )$. A searcher tries to locate it by choosing points $x_i $ and asking: Is egreater than $x_i $ ?There is a positive probability of obtaining a wrong answer to these questions. The searcher wishes to locate the object in the smallest set possible in spite of the fact that some of the information ...
openaire +1 more source
Stochastic Games with Synchronization Objectives
Journal of the ACM, 2023We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding stochasticity. The outcome of the game is a sequence of distributions over the graph states, representing the evolution ...
openaire +2 more sources