Regulation of Algorithmic Collusion
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 buy...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2024-09 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Hartline, Jason D Long, Sheng Zhang, Chenhao |
description | 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 contain 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. |
doi_str_mv | 10.48550/arxiv.2401.15794 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2401_15794</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2919924487</sourcerecordid><originalsourceid>FETCH-LOGICAL-a527-79cb9128a61e7c87f41e3eb1507e42c350328624b943be426c805396d928878e3</originalsourceid><addsrcrecordid>eNotj01LAzEYhIMgWGp_gCcXet41efN9LIsfhYIgvYdszNaUtKnJrui_d209DcwMwzwI3RHcMMU5frD5O3w1wDBpCJeaXaEZUEpqxQBu0KKUPcYYhATO6Qwt3_xujHYI6VilvlrFXcph-DgEV7UpxrFMwS267m0sfvGvc7R9ety2L_Xm9Xndrja15SBrqV2nCSgriJdOyZ4RT31HOJaegaMcU1ACWKcZ7SZHOIU51eJdg1JSeTpH95fZM4E55XCw-cf8kZgzydRYXhqnnD5HXwazT2M-Tp8MaKI1MKYk_QXATkji</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2919924487</pqid></control><display><type>article</type><title>Regulation of Algorithmic Collusion</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Hartline, Jason D ; Long, Sheng ; Zhang, Chenhao</creator><creatorcontrib>Hartline, Jason D ; Long, Sheng ; Zhang, Chenhao</creatorcontrib><description>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 contain 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.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2401.15794</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Audits ; Collusion ; Computer Science - Computer Science and Game Theory ; Statistical tests ; Supply & demand</subject><ispartof>arXiv.org, 2024-09</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1145/3614407.3643706$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2401.15794$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hartline, Jason D</creatorcontrib><creatorcontrib>Long, Sheng</creatorcontrib><creatorcontrib>Zhang, Chenhao</creatorcontrib><title>Regulation of Algorithmic Collusion</title><title>arXiv.org</title><description>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 contain 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.</description><subject>Algorithms</subject><subject>Audits</subject><subject>Collusion</subject><subject>Computer Science - Computer Science and Game Theory</subject><subject>Statistical tests</subject><subject>Supply & demand</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj01LAzEYhIMgWGp_gCcXet41efN9LIsfhYIgvYdszNaUtKnJrui_d209DcwMwzwI3RHcMMU5frD5O3w1wDBpCJeaXaEZUEpqxQBu0KKUPcYYhATO6Qwt3_xujHYI6VilvlrFXcph-DgEV7UpxrFMwS267m0sfvGvc7R9ety2L_Xm9Xndrja15SBrqV2nCSgriJdOyZ4RT31HOJaegaMcU1ACWKcZ7SZHOIU51eJdg1JSeTpH95fZM4E55XCw-cf8kZgzydRYXhqnnD5HXwazT2M-Tp8MaKI1MKYk_QXATkji</recordid><startdate>20240929</startdate><enddate>20240929</enddate><creator>Hartline, Jason D</creator><creator>Long, Sheng</creator><creator>Zhang, Chenhao</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>ADEOX</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240929</creationdate><title>Regulation of Algorithmic Collusion</title><author>Hartline, Jason D ; Long, Sheng ; Zhang, Chenhao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a527-79cb9128a61e7c87f41e3eb1507e42c350328624b943be426c805396d928878e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Audits</topic><topic>Collusion</topic><topic>Computer Science - Computer Science and Game Theory</topic><topic>Statistical tests</topic><topic>Supply & demand</topic><toplevel>online_resources</toplevel><creatorcontrib>Hartline, Jason D</creatorcontrib><creatorcontrib>Long, Sheng</creatorcontrib><creatorcontrib>Zhang, Chenhao</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Economics</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hartline, Jason D</au><au>Long, Sheng</au><au>Zhang, Chenhao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Regulation of Algorithmic Collusion</atitle><jtitle>arXiv.org</jtitle><date>2024-09-29</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>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 contain 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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2401.15794</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-09 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2401_15794 |
source | arXiv.org; Free E- Journals |
subjects | Algorithms Audits Collusion Computer Science - Computer Science and Game Theory Statistical tests Supply & demand |
title | Regulation of Algorithmic Collusion |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T06%3A09%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Regulation%20of%20Algorithmic%20Collusion&rft.jtitle=arXiv.org&rft.au=Hartline,%20Jason%20D&rft.date=2024-09-29&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2401.15794&rft_dat=%3Cproquest_arxiv%3E2919924487%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2919924487&rft_id=info:pmid/&rfr_iscdi=true |