Controlling chaos in distributed systems
The DOI matches its Crossref record.
Abstract
A simple and robust procedure for freezing out chaotic behavior in systems composed of interacting agents making decisions based on imperfect and delayed information is described. It is based on a reward mechanism whereby the relative number of computational agents following effective strategies is increased at the expense of the others. This procedure, which generates a diverse population out of an essentially homogeneous one, is able to control chaos through a series of dynamical bifurcations into a stable fixed point. Stability boundaries are computed and the minimal amount of diversity required in the system is established.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Supply-chain networks: a complex adaptive systems perspective
Surana, A., Kumara *, S., Greaves, M., & Raghavan, U. N. (2005) · International Journal of Production Research · doi:10.1080/00207540500142274 · Cited by 620
Dynamics of an information-filtering economy
Kephart, J. O., Hanson, J. E., Levine, D. W., Grosof, B. N., Sairamesh, J., Segal, R. B., & White, S. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0053682 · Cited by 59
Price and Niche Wars in a Free-Market Economy of Software Agents
Kephart, J. O., Hanson, J. E., & Sairamesh, J. (1998) · Artificial Life · doi:10.1162/106454698568413 · Cited by 53
“Agents may be designed to cooperate [8] or to compete [ 6 ], but so long as the aggregate evolves toward a globally defined optimum, the system as a whole is deemed successful.”
Background
Metadata
- Authors
- Hogg, T., & Huberman, B. A.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1991
- Volume
- 21
- Issue
- 6
- Pages
- 1325-1332
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2080908217
- Cited by
- 200
- References
- 0
- FWCI
- 3.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Controlling chaos in distributed systems. https://app.cochat.ai/papers/10.1109/21.135679
- The paper
- Hogg, T., & Huberman, B. A. (1991). Controlling chaos in distributed systems. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/21.135679
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.