TY - GEN
T1 - Regulation of Algorithmic Collusion
AU - Hartline, Jason D.
AU - Long, Sheng
AU - Zhang, Chenhao
N1 - Publisher Copyright:
© 2024 Owner/Author.
PY - 2024/3/12
Y1 - 2024/3/12
N2 - Consider sellers in a competitive market that use algorithms to adapt their prices from data that they collect. In such a context it is plausible that algorithms could arrive at prices that are higher than the competitive prices and this may benefit sellers at the expense of consumers (i.e., the buyers in the market). This paper gives a definition of plausible algorithmic non-collusion for pricing algorithms. The definition allows a regulator to empirically audit algorithms by applying a statistical test to the data that they collect. Algorithms that are good, i.e., approximately optimize prices to market conditions, can be augmented to collect the data sufficient to pass the audit. Algorithms that have colluded on, e.g., supra-competitive prices cannot pass the audit. The definition allows sellers to possess useful side information that may be correlated with supply and demand and could affect the prices used by good algorithms. The paper provides an analysis of the statistical complexity of such an audit, i.e., how much data is sufficient for the test of non-collusion to be accurate.
AB - Consider sellers in a competitive market that use algorithms to adapt their prices from data that they collect. In such a context it is plausible that algorithms could arrive at prices that are higher than the competitive prices and this may benefit sellers at the expense of consumers (i.e., the buyers in the market). This paper gives a definition of plausible algorithmic non-collusion for pricing algorithms. The definition allows a regulator to empirically audit algorithms by applying a statistical test to the data that they collect. Algorithms that are good, i.e., approximately optimize prices to market conditions, can be augmented to collect the data sufficient to pass the audit. Algorithms that have colluded on, e.g., supra-competitive prices cannot pass the audit. The definition allows sellers to possess useful side information that may be correlated with supply and demand and could affect the prices used by good algorithms. The paper provides an analysis of the statistical complexity of such an audit, i.e., how much data is sufficient for the test of non-collusion to be accurate.
KW - Algorithmic collusion
KW - Algorithmic pricing
KW - Antitrust
KW - Regulation of algorithms
UR - http://www.scopus.com/inward/record.url?scp=85188724677&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85188724677&partnerID=8YFLogxK
U2 - 10.1145/3614407.3643706
DO - 10.1145/3614407.3643706
M3 - Conference contribution
AN - SCOPUS:85188724677
T3 - CSLAW 2024 - Proceedings of the 3rd Symposium on Computer Science and Law
SP - 98
EP - 108
BT - CSLAW 2024 - Proceedings of the 3rd Symposium on Computer Science and Law
PB - Association for Computing Machinery, Inc
T2 - 3rd Symposium on Computer Science and Law, CSLAW 2024
Y2 - 12 March 2024 through 13 March 2024
ER -