{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G2Y2KJRLUTDPAPLFI5RGJHEHQA","short_pith_number":"pith:G2Y2KJRL","schema_version":"1.0","canonical_sha256":"36b1a5262ba4c6f03d654762649c87802ddef78e98aa91e0a7b61892b6edde60","source":{"kind":"arxiv","id":"2608.09894","version":1},"attestation_state":"computed","paper":{"title":"Competitive mediator games and urban CAV routing markets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA","econ.TH","math.OC"],"primary_cat":"cs.GT","authors_text":"Grzegorz Jamr\\'oz","submitted_at":"2026-08-10T17:42:40Z","abstract_excerpt":"Inspired by possible future markets of autonomous routing and driving (ARAD), we introduce competitive mediator games and their equilibria which generalize the (coarse) correlated equilibria, which have become a popular research area recently as they not only can be more socially efficient than Nash equilibria but also are limits of algorithmic no-regret multi-agent learning dynamics. We discuss the basic properties of competitive mediator games and prove that in the generic setting of anonymous congestion(routing) games with market-share maximizing mediators all competitive mediator equilibri"},"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":"2608.09894","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-10T17:42:40Z","cross_cats_sorted":["cs.MA","econ.TH","math.OC"],"title_canon_sha256":"33967648eb61fef92c2138f5957c041f3d3684dc8366a459ea871b93746f91d3","abstract_canon_sha256":"a5868a6f222c9d6a3fa44c13c990b57038911d8b7a9dde0c16bbfe349c03119d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:25:23.675495Z","signature_b64":"XbdnSzWkwKVyrmRmqzflKd+lFxV11vK67cMbXmwwiR4JjASDfu9DWa3vjc4u7/EeiNwH476orH087TYlGjJvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b1a5262ba4c6f03d654762649c87802ddef78e98aa91e0a7b61892b6edde60","last_reissued_at":"2026-08-11T02:25:23.673740Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:25:23.673740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive mediator games and urban CAV routing markets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA","econ.TH","math.OC"],"primary_cat":"cs.GT","authors_text":"Grzegorz Jamr\\'oz","submitted_at":"2026-08-10T17:42:40Z","abstract_excerpt":"Inspired by possible future markets of autonomous routing and driving (ARAD), we introduce competitive mediator games and their equilibria which generalize the (coarse) correlated equilibria, which have become a popular research area recently as they not only can be more socially efficient than Nash equilibria but also are limits of algorithmic no-regret multi-agent learning dynamics. We discuss the basic properties of competitive mediator games and prove that in the generic setting of anonymous congestion(routing) games with market-share maximizing mediators all competitive mediator equilibri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09894","kind":"arxiv","version":1},"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/2608.09894/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":"2608.09894","created_at":"2026-08-11T02:25:23.674482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09894v1","created_at":"2026-08-11T02:25:23.674482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09894","created_at":"2026-08-11T02:25:23.674482+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2Y2KJRLUTDP","created_at":"2026-08-11T02:25:23.674482+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2Y2KJRLUTDPAPLF","created_at":"2026-08-11T02:25:23.674482+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2Y2KJRL","created_at":"2026-08-11T02:25:23.674482+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/G2Y2KJRLUTDPAPLFI5RGJHEHQA","json":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA.json","graph_json":"https://pith.science/api/pith-number/G2Y2KJRLUTDPAPLFI5RGJHEHQA/graph.json","events_json":"https://pith.science/api/pith-number/G2Y2KJRLUTDPAPLFI5RGJHEHQA/events.json","paper":"https://pith.science/paper/G2Y2KJRL"},"agent_actions":{"view_html":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA","download_json":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA.json","view_paper":"https://pith.science/paper/G2Y2KJRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09894&json=true","fetch_graph":"https://pith.science/api/pith-number/G2Y2KJRLUTDPAPLFI5RGJHEHQA/graph.json","fetch_events":"https://pith.science/api/pith-number/G2Y2KJRLUTDPAPLFI5RGJHEHQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA/action/storage_attestation","attest_author":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA/action/author_attestation","sign_citation":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA/action/citation_signature","submit_replication":"https://pith.science/pith/G2Y2KJRLUTDPAPLFI5RGJHEHQA/action/replication_record"}},"created_at":"2026-08-11T02:25:23.674482+00:00","updated_at":"2026-08-11T02:25:23.674482+00:00"}