{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HJMBS3FD4TCO3RGZRYD7LPJH4N","short_pith_number":"pith:HJMBS3FD","schema_version":"1.0","canonical_sha256":"3a58196ca3e4c4edc4d98e07f5bd27e37088898c669f87ea01655c5ca6db13f1","source":{"kind":"arxiv","id":"1507.01501","version":2},"attestation_state":"computed","paper":{"title":"On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Daniel Reichman, Joseph Y. Halpern, Rafael Pass","submitted_at":"2015-07-06T15:33:22Z","abstract_excerpt":"We consider sequences of games $\\mathcal{G}=\\{G_1,G_2,\\ldots\\}$ where, for all $n$, $G_n$ has the same set of players. Such sequences arise in the analysis of running time of players in games, in electronic money systems such as Bitcoin and in cryptographic protocols. Assuming that one-way functions exist, we prove that there is a sequence of 2-player zero-sum Bayesian games $\\mathcal{G}$ such that, for all $n$, the size of every action in $G_n$ is polynomial in $n$, the utility function is polynomial computable in $n$, and yet there is no polynomial-time Nash equilibrium, where we use a notio"},"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":"1507.01501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-06T15:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"872cba0053a42c2510d0eaadf65a1b178e0cdf876f4c17ac94f9d1c466344fd5","abstract_canon_sha256":"b599408101ae9a29ec1175bea229ba994177e43e5015bb2c971ba5162d329e3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:52.582612Z","signature_b64":"wFwNZIOj/Oduq6ykOYGh2xiPCeV6Davg1wb3Q3NveYKieLSblQUy3k+nL6pS7g4a1cTzbMFMlM9LWabxaolECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a58196ca3e4c4edc4d98e07f5bd27e37088898c669f87ea01655c5ca6db13f1","last_reissued_at":"2026-05-18T01:36:52.581870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:52.581870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Daniel Reichman, Joseph Y. Halpern, Rafael Pass","submitted_at":"2015-07-06T15:33:22Z","abstract_excerpt":"We consider sequences of games $\\mathcal{G}=\\{G_1,G_2,\\ldots\\}$ where, for all $n$, $G_n$ has the same set of players. Such sequences arise in the analysis of running time of players in games, in electronic money systems such as Bitcoin and in cryptographic protocols. Assuming that one-way functions exist, we prove that there is a sequence of 2-player zero-sum Bayesian games $\\mathcal{G}$ such that, for all $n$, the size of every action in $G_n$ is polynomial in $n$, the utility function is polynomial computable in $n$, and yet there is no polynomial-time Nash equilibrium, where we use a notio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01501","kind":"arxiv","version":2},"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":"1507.01501","created_at":"2026-05-18T01:36:52.581996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01501v2","created_at":"2026-05-18T01:36:52.581996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01501","created_at":"2026-05-18T01:36:52.581996+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJMBS3FD4TCO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJMBS3FD4TCO3RGZ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJMBS3FD","created_at":"2026-05-18T12:29:25.134429+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/HJMBS3FD4TCO3RGZRYD7LPJH4N","json":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N.json","graph_json":"https://pith.science/api/pith-number/HJMBS3FD4TCO3RGZRYD7LPJH4N/graph.json","events_json":"https://pith.science/api/pith-number/HJMBS3FD4TCO3RGZRYD7LPJH4N/events.json","paper":"https://pith.science/paper/HJMBS3FD"},"agent_actions":{"view_html":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N","download_json":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N.json","view_paper":"https://pith.science/paper/HJMBS3FD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01501&json=true","fetch_graph":"https://pith.science/api/pith-number/HJMBS3FD4TCO3RGZRYD7LPJH4N/graph.json","fetch_events":"https://pith.science/api/pith-number/HJMBS3FD4TCO3RGZRYD7LPJH4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N/action/storage_attestation","attest_author":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N/action/author_attestation","sign_citation":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N/action/citation_signature","submit_replication":"https://pith.science/pith/HJMBS3FD4TCO3RGZRYD7LPJH4N/action/replication_record"}},"created_at":"2026-05-18T01:36:52.581996+00:00","updated_at":"2026-05-18T01:36:52.581996+00:00"}