Automata, matching and foraging behavior of bees
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 1993-78.
Date of creation: 1993
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Peleg, B. & Shmida, A., 1992. "Short-rune stable matchings between bees and flowers," Games and Economic Behavior, Elsevier, vol. 4(2), pages 232-251, April.
- Fishburn, Peter C., 1976. "Continua of stochastic dominance relations for bounded probability distributions," Journal of Mathematical Economics, Elsevier, vol. 3(3), pages 295-311, December.
- Rothschild, Michael, 1974. "A two-armed bandit theory of market pricing," Journal of Economic Theory, Elsevier, vol. 9(2), pages 185-202, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.