Stanford Mathematical Studies in the Social Sciences, Volume 8 |
From inside the book
Results 1-3 of 80
Page 55
... trial paradigm for a simple learning experiment involving nonreinforced trials is given below . Paradigm for a ... trial n , the probability of A , on trial n + 1 will be a specific linear function of the probability on trial n . If E ...
... trial paradigm for a simple learning experiment involving nonreinforced trials is given below . Paradigm for a ... trial n , the probability of A , on trial n + 1 will be a specific linear function of the probability on trial n . If E ...
Page 286
... trial determines the size of the response change for the next trial . That is , the subject tends to change his response in proportion to the distance of his response from the correct response on a given trial . If the correct response ...
... trial determines the size of the response change for the next trial . That is , the subject tends to change his response in proportion to the distance of his response from the correct response on a given trial . If the correct response ...
Page 357
... trial n + 1 and the response on trial n agree with the social stimulus on trial n and when , on the other hand , these first two events disagree with the social stimulus on trial n . In the first case , the probability of an A ...
... trial n + 1 and the response on trial n agree with the social stimulus on trial n and when , on the other hand , these first two events disagree with the social stimulus on trial n . In the first case , the probability of an A ...
Other editions - View all
Common terms and phrases
A₁ alternative analysis applied Asch assumption asymptotic Atkinson AU's autotelic axioms behavior binomial distribution C₁ C₂ cent choice coalition concept conditional probabilities consider correct defined deontic logic depend described discussion distribution dyadic effect elementary equations estimate example function game theory given group members individual learning experiments learning models linear model Markov Markov chain mathematical matrix mean measures minimax modèle observed obtained occurs outcome P(A₁ P(Yes p₁ pair paper paradigm parameters payoff person plausibilités player possible prediction present probabilités problem proportion Psychol punishment R₁ random variables recursions reference group reinforcing events rejection relation relationship réponse response probabilities reward S₁ S₂ sequence simple social stimulus solution Stanford statistical learning theory stimulus stochastic structure subjects sujet Suppes task theoretical tion transition probabilities trial trial n two-person interactions Univ values zero-sum zero-sum game