00:02
Hello, let's have a look at the question.
00:04
So now the matching law states that the number of responses is directly equal to the number of reinforces that is provided b1 upon b1 plus b2 will be equals to r1 upon r1 plus r2.
00:35
Now, if we reduce the time of response, if we will reduce this time of response, then the repetition of behavior, the repetition of behavior by the pigeon by pigeon, so they obtain the results frequently.
01:12
Now like let us take example a two minute gap between the behavior and the behavior and response.
01:35
So if we reduce it to one minute or 40 seconds then the behavior will be frequent.
02:03
Now to get the perfect matching, we will expect the data line to fall along the diagonal line, meaning that we will randomize the several responses which are provided after the region acts on them.
02:28
Now this diagonal line indicates that there is no favoring or bias occurring in the condition and the matching will be done perfectly or ideally.
02:43
Now, the proportion of response almost matched the number of reinforces provided.
03:12
Now, the two confederates providing the positive reinforcements to subjects and subjects response to any proportional way to confederates.
03:22
So, the expended results in the case of distribution of response between the alternatives will be.
03:29
First case will be when both the responses both responses are identical to each other.
03:43
So when they are identical in this case the matching law will be achieved where the number of responses will be will be equal to the number of times behavior is scheduled.
04:09
Now the second case will be when both responses are varying with each other.
04:26
So in this scenario there can be alteration or variation in the number of responses in number of responses and this will be different to the number of times and different to the number of times behavior is scheduled...