{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LKVZP5OOZJ4IREENT54DYQXJJQ","short_pith_number":"pith:LKVZP5OO","schema_version":"1.0","canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","source":{"kind":"arxiv","id":"2312.02644","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic collusion under competitive design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Ivan Conjeaud","submitted_at":"2023-12-05T10:35:41Z","abstract_excerpt":"We study a simple model of algorithmic collusion in which Q-learning algorithms are designed in a strategic fashion. We let players (\\textit{designers}) choose their exploration policy simultaneously prior to letting their algorithms repeatedly play a prisoner's dilemma. We prove that, in equilibrium, collusive behavior is reached with positive probability. Our numerical simulations indicate symmetry of the equilibria and give insight for how they are affected by a parameter of interest. We also investigate general profiles of exploration policies. We characterize the behavior of the system fo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2312.02644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-12-05T10:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"ca4c07e5020aaf1fb53e0a22dd423dbbe188545bdd9f1285b673c08c5b4dfb2f","abstract_canon_sha256":"e7fbb631d3a7cd1599b4b712baa6898834c21664013dc03eda78cc49c545c983"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:01.539015Z","signature_b64":"z0vgRhyRnYvU/qe6Wsrv1kPCEUQymT1Es6sG5yUKtkkY4O3UNMB2B5umnURKRjdzjf2aK83ulMxO/hPapr+7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","last_reissued_at":"2026-07-05T09:06:01.538543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:01.538543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic collusion under competitive design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Ivan Conjeaud","submitted_at":"2023-12-05T10:35:41Z","abstract_excerpt":"We study a simple model of algorithmic collusion in which Q-learning algorithms are designed in a strategic fashion. We let players (\\textit{designers}) choose their exploration policy simultaneously prior to letting their algorithms repeatedly play a prisoner's dilemma. We prove that, in equilibrium, collusive behavior is reached with positive probability. Our numerical simulations indicate symmetry of the equilibria and give insight for how they are affected by a parameter of interest. We also investigate general profiles of exploration policies. We characterize the behavior of the system fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02644","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.02644/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2312.02644","created_at":"2026-07-05T09:06:01.538599+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02644v3","created_at":"2026-07-05T09:06:01.538599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02644","created_at":"2026-07-05T09:06:01.538599+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKVZP5OOZJ4I","created_at":"2026-07-05T09:06:01.538599+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKVZP5OOZJ4IREEN","created_at":"2026-07-05T09:06:01.538599+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKVZP5OO","created_at":"2026-07-05T09:06:01.538599+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ","json":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ.json","graph_json":"https://pith.science/api/pith-number/LKVZP5OOZJ4IREENT54DYQXJJQ/graph.json","events_json":"https://pith.science/api/pith-number/LKVZP5OOZJ4IREENT54DYQXJJQ/events.json","paper":"https://pith.science/paper/LKVZP5OO"},"agent_actions":{"view_html":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ","download_json":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ.json","view_paper":"https://pith.science/paper/LKVZP5OO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02644&json=true","fetch_graph":"https://pith.science/api/pith-number/LKVZP5OOZJ4IREENT54DYQXJJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LKVZP5OOZJ4IREENT54DYQXJJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/action/storage_attestation","attest_author":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/action/author_attestation","sign_citation":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/action/citation_signature","submit_replication":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/action/replication_record"}},"created_at":"2026-07-05T09:06:01.538599+00:00","updated_at":"2026-07-05T09:06:01.538599+00:00"}