{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AOA5MRBSVU6Z7DVTKFZYYKEB57","short_pith_number":"pith:AOA5MRBS","schema_version":"1.0","canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","source":{"kind":"arxiv","id":"1903.06288","version":1},"attestation_state":"computed","paper":{"title":"Optimal Price of Anarchy in Cost-Sharing Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.SY","authors_text":"Dario Paccagnan, Jason R. Marden, Rahul Chandan","submitted_at":"2019-03-14T22:44:55Z","abstract_excerpt":"The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propose a framework for designing distributed algorithms with a priori performance guarantees that are near-optimal. We approach this problem from a game-theoretic perspective, assigning agents cost functions such that the equilibrium efficiency (price of anarchy) is optimized. Once agents' cost functions have been specified, any algorithm capable of computing a Nash equilibrium of the system inherits a performance guaran"},"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":"1903.06288","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2019-03-14T22:44:55Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"81012498d1fe794e65a58660d2ed39626ec122aed8652f9ea2704476e1b69f67","abstract_canon_sha256":"c88ddd7ec07fa90df26aa1d0103f59397693b2d5420d9f6449e9898df4a5f24d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:11.222790Z","signature_b64":"CsBccnghsl/Dd1DXNvSTPxxD1eA8htUtE4NL/ehd2l2YkLGauHsG0ntDJz013jLbxqUlfmw1hzdueDpNafD9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0381d64432ad3d9f8eb351738c2881efdbe09dc8e6fefb5bd4b8b37130ccd738","last_reissued_at":"2026-05-17T23:51:11.222164Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:11.222164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Price of Anarchy in Cost-Sharing Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.SY","authors_text":"Dario Paccagnan, Jason R. Marden, Rahul Chandan","submitted_at":"2019-03-14T22:44:55Z","abstract_excerpt":"The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propose a framework for designing distributed algorithms with a priori performance guarantees that are near-optimal. We approach this problem from a game-theoretic perspective, assigning agents cost functions such that the equilibrium efficiency (price of anarchy) is optimized. Once agents' cost functions have been specified, any algorithm capable of computing a Nash equilibrium of the system inherits a performance guaran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06288","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":""},"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":"1903.06288","created_at":"2026-05-17T23:51:11.222257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06288v1","created_at":"2026-05-17T23:51:11.222257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06288","created_at":"2026-05-17T23:51:11.222257+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOA5MRBSVU6Z","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOA5MRBSVU6Z7DVT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOA5MRBS","created_at":"2026-05-18T12:33:12.712433+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/AOA5MRBSVU6Z7DVTKFZYYKEB57","json":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57.json","graph_json":"https://pith.science/api/pith-number/AOA5MRBSVU6Z7DVTKFZYYKEB57/graph.json","events_json":"https://pith.science/api/pith-number/AOA5MRBSVU6Z7DVTKFZYYKEB57/events.json","paper":"https://pith.science/paper/AOA5MRBS"},"agent_actions":{"view_html":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57","download_json":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57.json","view_paper":"https://pith.science/paper/AOA5MRBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06288&json=true","fetch_graph":"https://pith.science/api/pith-number/AOA5MRBSVU6Z7DVTKFZYYKEB57/graph.json","fetch_events":"https://pith.science/api/pith-number/AOA5MRBSVU6Z7DVTKFZYYKEB57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/action/storage_attestation","attest_author":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/action/author_attestation","sign_citation":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/action/citation_signature","submit_replication":"https://pith.science/pith/AOA5MRBSVU6Z7DVTKFZYYKEB57/action/replication_record"}},"created_at":"2026-05-17T23:51:11.222257+00:00","updated_at":"2026-05-17T23:51:11.222257+00:00"}