{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:22OFNAGY6X6XYAAGPFMNUBFALV","short_pith_number":"pith:22OFNAGY","schema_version":"1.0","canonical_sha256":"d69c5680d8f5fd7c00067958da04a05d48a95a29f3684ff16b20d907244e0dd8","source":{"kind":"arxiv","id":"2208.04237","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Reinforcement Learning for Long-Term Network Resource Allocation through Auction: a V2X Application","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Artur Hecker, Holger Karl, Jing Tan, Ramin Khalili","submitted_at":"2022-07-29T10:29:06Z","abstract_excerpt":"We formulate offloading of computational tasks from a dynamic group of mobile agents (e.g., cars) as decentralized decision making among autonomous agents. We design an interaction mechanism that incentivizes such agents to align private and system goals by balancing between competition and cooperation. In the static case, the mechanism provably has Nash equilibria with optimal resource allocation. In a dynamic environment, this mechanism's requirement of complete information is impossible to achieve. For such environments, we propose a novel multi-agent online learning algorithm that learns w"},"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":"2208.04237","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2022-07-29T10:29:06Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e53d39c2757426aabde0f8455f8f62a02a1fcd33ac6258af012b2a0756f08787","abstract_canon_sha256":"b6048cc22519379fdfbcc34920653ea7d99d12c10206198bc9a563dc88e48d1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:29.785101Z","signature_b64":"6/fpQP3Prby4HGFBic1qR4ABnUREJGCEnH9AkX6fLxbndWYtUTgjwQEqjbjiuPm72Qhn0Kn3+FHrrhYCGyu+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d69c5680d8f5fd7c00067958da04a05d48a95a29f3684ff16b20d907244e0dd8","last_reissued_at":"2026-07-05T04:47:29.784638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:29.784638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Reinforcement Learning for Long-Term Network Resource Allocation through Auction: a V2X Application","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Artur Hecker, Holger Karl, Jing Tan, Ramin Khalili","submitted_at":"2022-07-29T10:29:06Z","abstract_excerpt":"We formulate offloading of computational tasks from a dynamic group of mobile agents (e.g., cars) as decentralized decision making among autonomous agents. We design an interaction mechanism that incentivizes such agents to align private and system goals by balancing between competition and cooperation. In the static case, the mechanism provably has Nash equilibria with optimal resource allocation. In a dynamic environment, this mechanism's requirement of complete information is impossible to achieve. For such environments, we propose a novel multi-agent online learning algorithm that learns w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04237","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/2208.04237/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":"2208.04237","created_at":"2026-07-05T04:47:29.784694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.04237v1","created_at":"2026-07-05T04:47:29.784694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04237","created_at":"2026-07-05T04:47:29.784694+00:00"},{"alias_kind":"pith_short_12","alias_value":"22OFNAGY6X6X","created_at":"2026-07-05T04:47:29.784694+00:00"},{"alias_kind":"pith_short_16","alias_value":"22OFNAGY6X6XYAAG","created_at":"2026-07-05T04:47:29.784694+00:00"},{"alias_kind":"pith_short_8","alias_value":"22OFNAGY","created_at":"2026-07-05T04:47:29.784694+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/22OFNAGY6X6XYAAGPFMNUBFALV","json":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV.json","graph_json":"https://pith.science/api/pith-number/22OFNAGY6X6XYAAGPFMNUBFALV/graph.json","events_json":"https://pith.science/api/pith-number/22OFNAGY6X6XYAAGPFMNUBFALV/events.json","paper":"https://pith.science/paper/22OFNAGY"},"agent_actions":{"view_html":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV","download_json":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV.json","view_paper":"https://pith.science/paper/22OFNAGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.04237&json=true","fetch_graph":"https://pith.science/api/pith-number/22OFNAGY6X6XYAAGPFMNUBFALV/graph.json","fetch_events":"https://pith.science/api/pith-number/22OFNAGY6X6XYAAGPFMNUBFALV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV/action/storage_attestation","attest_author":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV/action/author_attestation","sign_citation":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV/action/citation_signature","submit_replication":"https://pith.science/pith/22OFNAGY6X6XYAAGPFMNUBFALV/action/replication_record"}},"created_at":"2026-07-05T04:47:29.784694+00:00","updated_at":"2026-07-05T04:47:29.784694+00:00"}