Abstract

AbstractWilson and Lessells (1993) analysed the effect of constraint assumptions on the predictions of static optimality models for insect clutch size. They concluded that the models could be reliably distinguished between (and hence the main constraints identified) only after precise quantitative predictions had been examined. The present paper describes a series of laboratory experiments, using the bruchid beetle Callosobruchus maculatus, that allow these quantitative predictions to be made and tested. Experiments in which female encounter rate with hosts was altered gave qualitative support for 3 out of 6 basic (single oviposition) models, but the quantitative fit of them all was poor. However, when the (a priori) condition was included in these models that several other females would oviposit on the same hosts (the multiple oviposition models), the time limiting multiple oviposition model alone produced quantitative predictions that were supported by observations. In other words, the results suggest that the main constraints on bruchid oviposition behaviour are the amount of time available for laying eggs and the number of other females ovipositing. However, additional qualitative predictions indicate that the number of eggs available to the female may also constrain clutch size evolutionarily. The usefulness of static optimality models for examining clutch size decisions in insects is discussed in the context of these results.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.