ML Anthology

Probability Matching, the Magnitude of Reinforcement, and Classifier System Bidding

David E. Goldberg
MLJ 1990 pp. 407-425
doi:10.1007/BF00116878 /mlj/1990/goldberg1990mlj-probability/

Abstract

This paper juxtaposes the probability matching paradox of decision theory and the magnitude of reinforcement problem of animal learning theory to show that simple classifier system bidding structures are unable to match the range of behaviors required in the deterministic and probabilistic problems faced by real cognitive systems. The inclusion of a variance-sensitive bidding (VSB) mechanism is suggested, analyzed, and simulated to enable good bidding performance over a wide range of nonstationary probabilistic and deterministic environments.

PDF MLJ Semantic Scholar

Cite

Text

Goldberg. "Probability Matching, the Magnitude of Reinforcement, and Classifier System Bidding." Machine Learning, 1990. doi:10.1007/BF00116878

Markdown

[Goldberg. "Probability Matching, the Magnitude of Reinforcement, and Classifier System Bidding." Machine Learning, 1990.](https://mlanthology.org/mlj/1990/goldberg1990mlj-probability/) doi:10.1007/BF00116878

BibTeX

@article{goldberg1990mlj-probability,
  title     = {{Probability Matching, the Magnitude of Reinforcement, and Classifier System Bidding}},
  author    = {Goldberg, David E.},
  journal   = {Machine Learning},
  year      = {1990},
  pages     = {407-425},
  doi       = {10.1007/BF00116878},
  volume    = {5},
  url       = {https://mlanthology.org/mlj/1990/goldberg1990mlj-probability/}
}