{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VTPWHJQ6T2MDJGASWMUOJJNUI5","short_pith_number":"pith:VTPWHJQ6","schema_version":"1.0","canonical_sha256":"acdf63a61e9e98349812b328e4a5b44748447f5b55fd747771035fd91beb1253","source":{"kind":"arxiv","id":"1512.03315","version":1},"attestation_state":"computed","paper":{"title":"Distributed Methods for Computing Approximate Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Argyrios Deligkas, Artur Czumaj, John Fearnley, Marcin Jurdzi\\'nski, Michail Fasoulakis, Rahul Savani","submitted_at":"2015-12-10T16:39:38Z","abstract_excerpt":"We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same time (for example, by solving a single LP that combines the two players payoffs), our algorithm first solves two independent LPs, each of which is derived from one of the two payoff matrices, and then compute approximate Nash equilibria using only limited communication between the players.\n  Our method has several applications for improved bounds for efficient computations of approximate Nash equilibria in bimatrix ga"},"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":"1512.03315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-10T16:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"854ec7aa00986ca50856ba802829dc95a18dcf4b3db5fc8307a99895bd681d98","abstract_canon_sha256":"1ee54a54e183ee8b8cfd3aff11bceff497d01ccd7225a64bd2a629e70db0a3f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:37.564039Z","signature_b64":"NbOzELL+dBnPaj1VBCHUu90LuzVcac7SwL2mm9ohg5cX3Y89oLDguMKG0w9qMEghUyLjsHwgHOLNdKuwMKAIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acdf63a61e9e98349812b328e4a5b44748447f5b55fd747771035fd91beb1253","last_reissued_at":"2026-05-18T00:03:37.563436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:37.563436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Methods for Computing Approximate Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Argyrios Deligkas, Artur Czumaj, John Fearnley, Marcin Jurdzi\\'nski, Michail Fasoulakis, Rahul Savani","submitted_at":"2015-12-10T16:39:38Z","abstract_excerpt":"We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same time (for example, by solving a single LP that combines the two players payoffs), our algorithm first solves two independent LPs, each of which is derived from one of the two payoff matrices, and then compute approximate Nash equilibria using only limited communication between the players.\n  Our method has several applications for improved bounds for efficient computations of approximate Nash equilibria in bimatrix ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03315","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":"1512.03315","created_at":"2026-05-18T00:03:37.563539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03315v1","created_at":"2026-05-18T00:03:37.563539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03315","created_at":"2026-05-18T00:03:37.563539+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTPWHJQ6T2MD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTPWHJQ6T2MDJGAS","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTPWHJQ6","created_at":"2026-05-18T12:29:47.479230+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/VTPWHJQ6T2MDJGASWMUOJJNUI5","json":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5.json","graph_json":"https://pith.science/api/pith-number/VTPWHJQ6T2MDJGASWMUOJJNUI5/graph.json","events_json":"https://pith.science/api/pith-number/VTPWHJQ6T2MDJGASWMUOJJNUI5/events.json","paper":"https://pith.science/paper/VTPWHJQ6"},"agent_actions":{"view_html":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5","download_json":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5.json","view_paper":"https://pith.science/paper/VTPWHJQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03315&json=true","fetch_graph":"https://pith.science/api/pith-number/VTPWHJQ6T2MDJGASWMUOJJNUI5/graph.json","fetch_events":"https://pith.science/api/pith-number/VTPWHJQ6T2MDJGASWMUOJJNUI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5/action/storage_attestation","attest_author":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5/action/author_attestation","sign_citation":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5/action/citation_signature","submit_replication":"https://pith.science/pith/VTPWHJQ6T2MDJGASWMUOJJNUI5/action/replication_record"}},"created_at":"2026-05-18T00:03:37.563539+00:00","updated_at":"2026-05-18T00:03:37.563539+00:00"}