Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 248

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Autonomous algorithmic collusion: Q‐learning under sequential pricing

Open access
Klein, Timo · 2021 · The RAND Journal of Economics

Abstract

Prices are increasingly set by algorithms. One concern is that intelligent algorithms may learn to collude on higher prices even in the absence of the kind of coordination necessary to establish an antitrust infringement. However, exactly how this may happen is an open question. I show how in simulated sequential competition, competing reinforcement learning algorithms can indeed learn to converge to collusive equilibria when the set of discrete prices is limited. When this set increases, the algorithm considered increasingly converges to supra‐competitive asymmetric cycles. I show that results are robust to various extensions and discuss practical limitations and policy implications.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1111/1756-2171.12383

Cites

6 of 6 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cites

Show all 6 references

Cited by

See all 248

Metadata

Authors
Klein, T.
Venue
The RAND Journal of Economics
Publisher
Wiley
Published
2021-08-09
Volume
52
Issue
3
Pages
538-558
ISSN
  • 0741-6261 (ISSN-L)
  • 1756-2171
OpenAlex
W3190428098
Cited by
248
References
6
FWCI
26.79
Type
journal article
Language
en
Open access
hybrid

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: Autonomous algorithmic collusion: Q‐learning under sequential pricing. https://app.cochat.ai/papers/10.1111/1756-2171.12383
The paper
Klein, T. (2021). Autonomous algorithmic collusion: Q‐learning under sequential pricing. The RAND Journal of Economics. https://doi.org/10.1111/1756-2171.12383

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.