NDLI: Stochastic automata games

Content Provider	IEEE Xplore Digital Library
Author	Chandrasekaran, B. Shen, D.W.C.
Copyright Year	1968
Description	Author affiliation: University of Pennsylvania, Philadelphia, Pa. (Shen, D.W.C.) \|\| Philco-Ford Corporation, Blue Bell, Pa. (Chandrasekaran, B.)
Abstract	A class of learning stochastic automata can be defined by the sextuple {S, F, ?, g, ??, T} where S is the input set, F is the finite set of r outputs (or strategies) of the automaton, ? is the finite set of r states, g is the output function which is a one-to-one mapping between the states and the outputs, ?? is the state probability vector whose ith component is the probability of the ith state being chosen. T is the reinforcement operator which guides the automaton in its learning by specifying the manner in which ?? is to be changed in response to the environment. The environment is specified by the penalty structure; namely, its response in the form of penalties to the outputs of the automaton. The reinforcement scheme enables the automaton to choose its outputs in such a manner as to reduce the mean penalty. This paper considers the collective behavior of the above finite state stochastic automata. This is of interest in view of the possibility of modelling 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 automaton is formulated and a nonlinear reinforcement specified. The finite state stochastic automaton is first considered in a game with nature, and conditions under which the automaton's winnings reach the von Neumann value of the game are established. Next, two stochastic automata with arbitrary number of states for each are considered in a game, the game matrix being specified. Performance of the automata for various conditions on the elements of the game matrix is considered. In a comparison of performance with deterministic automata, it is established that for performance comparable to that of the finite state stochastic automaton, the deterministic automaton needs an infinite number of states. Finally some games are simulated on a computer which verifies the general analysis and further throws light on the details of the game.
Starting Page	63
Ending Page	63
File Size	464685
Page Count	1
File Format	PDF
DOI	10.1109/SAP.1968.267095
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1968-12-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Stochastic processes Automata Psychology
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Games of Stochastic Automata

Solving Partial-Information Stochastic Parity Games

Stochastic Automata Games

An N-player sequential stochastic game with identical payoffs

Learning behavior of variable-structure stochastic automata in a three-person zero-sum game

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

Instabilities in learning automata playing games with delayed information

Adaptation of stochastic automata in nonstationary environments

Decentralized Indirect Methods for Learning Automata Games

Stochastic automata games

Similar Documents

Games of Stochastic Automata

Solving Partial-Information Stochastic Parity Games

Stochastic Automata Games

An N-player sequential stochastic game with identical payoffs

Learning behavior of variable-structure stochastic automata in a three-person zero-sum game

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

Instabilities in learning automata playing games with delayed information

Adaptation of stochastic automata in nonstationary environments

Decentralized Indirect Methods for Learning Automata Games

Stochastic automata games