{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DOSUBFS6GH2S7VWXSNJJD45C46","short_pith_number":"pith:DOSUBFS6","schema_version":"1.0","canonical_sha256":"1ba540965e31f52fd6d7935291f3a2e7b4c303a96bbc2ffb2a474a2d0030dd03","source":{"kind":"arxiv","id":"1701.06717","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds on the Complexity of Solving Two Classes of Non-cooperative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ehsan Nekouei, Girish N. Nair, Robin J. Evans, Tansu Alpcan","submitted_at":"2017-01-24T02:46:23Z","abstract_excerpt":"This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game class is defined as the minimum number of iterations required to find a Nash equilibrium (NE) of any game in that class with $\\epsilon$ accuracy. First, we consider the class $\\mathcal{G}$ of all $N$-player non-cooperative games with a continuous action space that admit at least one NE. Using information-theoretic inequalities, we derive a lower bound on the co"},"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":"1701.06717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T02:46:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8428eacdb712e17d4b62bf5e4b84cd1c068c7e215342068392f23a8b96d4199","abstract_canon_sha256":"cf33faba8469ece014a54d110655f5cd6010c04f1eb6ba1b32e95f0a807d2bff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.317767Z","signature_b64":"RQ9F7n4gcnfznvWbB4KAmR6JwG7fsV6aKwX/WB99Mxy7H6geFCgVSYG0XBmAS65ypET2iEYtNP95yMhrFF5ODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba540965e31f52fd6d7935291f3a2e7b4c303a96bbc2ffb2a474a2d0030dd03","last_reissued_at":"2026-05-18T00:52:12.317344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.317344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on the Complexity of Solving Two Classes of Non-cooperative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ehsan Nekouei, Girish N. Nair, Robin J. Evans, Tansu Alpcan","submitted_at":"2017-01-24T02:46:23Z","abstract_excerpt":"This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game class is defined as the minimum number of iterations required to find a Nash equilibrium (NE) of any game in that class with $\\epsilon$ accuracy. First, we consider the class $\\mathcal{G}$ of all $N$-player non-cooperative games with a continuous action space that admit at least one NE. Using information-theoretic inequalities, we derive a lower bound on the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06717","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":"1701.06717","created_at":"2026-05-18T00:52:12.317421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06717v1","created_at":"2026-05-18T00:52:12.317421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06717","created_at":"2026-05-18T00:52:12.317421+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOSUBFS6GH2S","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOSUBFS6GH2S7VWX","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOSUBFS6","created_at":"2026-05-18T12:31:12.930513+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/DOSUBFS6GH2S7VWXSNJJD45C46","json":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46.json","graph_json":"https://pith.science/api/pith-number/DOSUBFS6GH2S7VWXSNJJD45C46/graph.json","events_json":"https://pith.science/api/pith-number/DOSUBFS6GH2S7VWXSNJJD45C46/events.json","paper":"https://pith.science/paper/DOSUBFS6"},"agent_actions":{"view_html":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46","download_json":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46.json","view_paper":"https://pith.science/paper/DOSUBFS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06717&json=true","fetch_graph":"https://pith.science/api/pith-number/DOSUBFS6GH2S7VWXSNJJD45C46/graph.json","fetch_events":"https://pith.science/api/pith-number/DOSUBFS6GH2S7VWXSNJJD45C46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46/action/storage_attestation","attest_author":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46/action/author_attestation","sign_citation":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46/action/citation_signature","submit_replication":"https://pith.science/pith/DOSUBFS6GH2S7VWXSNJJD45C46/action/replication_record"}},"created_at":"2026-05-18T00:52:12.317421+00:00","updated_at":"2026-05-18T00:52:12.317421+00:00"}