Premium
HOW TO MAXIMIZE REWARD RATE ON TWO VARIABLE‐INTERVAL PARADIGMS
Author(s) -
Houston Alasdair I.,
McNamara John
Publication year - 1981
Publication title -
journal of the experimental analysis of behavior
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.75
H-Index - 61
eISSN - 1938-3711
pISSN - 0022-5002
DOI - 10.1901/jeab.1981.35-367
Subject(s) - changeover , matching law , schedule , interval (graph theory) , variable (mathematics) , maximization , computer science , matching (statistics) , mathematical optimization , mathematics , statistics , combinatorics , transmission (telecommunications) , operating system , telecommunications , mathematical analysis
Without assuming any constraints on behavior, we derive the policy that maximizes overall reward rate on two variable‐interval paradigms. The first paradigm is concurrent variable time‐variable time with changeover delay. It is shown that for nearly all parameter values, a switch to the schedule with the longer interval should be followed immediately by a switch back to the schedule with the shorter interval. The matching law does not hold at the optimum and does not uniquely specify the obtained reward rate. The second paradigm is discrete trial concurrent variable interval‐variable interval. For given schedule parameters, the optimal policy involves a cycle of a fixed number of choices of the schedule with the shorter interval followed by one choice of the schedule with the longer interval. Molecular maximization sometimes results in optimal behavior.