ABSTRACT
This chapter explains a concurrent schedules, choice, and preference. Concurrent schedule arrangements is used to study interactions between responses under the simultaneous control of different schedules and to study choice or preference. There are two types of concurrent schedules: single-response concurrent schedules and multiple-response concurrent schedules. The generalized matching law (GML) provides a reasonably accurate description of behavior in a variety of situation. It has been confirmed most often with pigeons pecking keys on concurrent schedules. One of the most influential theories in the mathematics of choice is the delay-reduction hypothesis. The amount of behavior on a component schedule relative to the amount of behavior on other component schedules can be taken as an indicator of the preference for that component schedule. Commitment procedure, which is a procedure in which an individual can choose to remove a choice that will still be available at a later time.
