{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BWBQZCZVL75NPEY6KSJYGN7526","short_pith_number":"pith:BWBQZCZV","schema_version":"1.0","canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","source":{"kind":"arxiv","id":"1608.00213","version":1},"attestation_state":"computed","paper":{"title":"Self-organization in a distributed coordination game through heuristic rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.EC","authors_text":"A. S. Chakrabarti, D. Ghosh, S. Agarwal","submitted_at":"2016-07-31T12:48:01Z","abstract_excerpt":"In this paper we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. Formally, $N$ agents play a coordination game repeatedly which has exactly $N$ Nash equilibria and all of the equilibria are equally preferred by the agents. The problem is to select one equilibrium out of $N$ possible equilibria in the least number of attempts. We propose a number of heuristic rules based on reinforcement learning to solve the coordination problem. We see th"},"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":"1608.00213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.EC","submitted_at":"2016-07-31T12:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"fca34b5beccfa1c00e656ae00121b965bb89fc9fab8d6b6fa973462f4646043b","abstract_canon_sha256":"727a9b9f8a2811b6a176534f05a91c2b33aa5587e8fb5c9ab3c3b4589967089b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:19.957704Z","signature_b64":"KICZCFLXIPaJQi78SHsSGQiJg+5Sy0ZSnaCsfszJ+NG8cvXSJG80wi4GvuC9dRW4OB/yZNkoqGxYIqOxHE2SBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d830c8b355ffad7931e54938337fdd7b65e81698fc1cbb4ef6d5e12c2bd025d","last_reissued_at":"2026-05-18T00:54:19.957354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:19.957354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-organization in a distributed coordination game through heuristic rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.EC","authors_text":"A. S. Chakrabarti, D. Ghosh, S. Agarwal","submitted_at":"2016-07-31T12:48:01Z","abstract_excerpt":"In this paper we consider a distributed coordination game played by a large number of agents with finite information sets, which characterizes emergence of a single dominant attribute out of a large number of competitors. Formally, $N$ agents play a coordination game repeatedly which has exactly $N$ Nash equilibria and all of the equilibria are equally preferred by the agents. The problem is to select one equilibrium out of $N$ possible equilibria in the least number of attempts. We propose a number of heuristic rules based on reinforcement learning to solve the coordination problem. We see th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00213","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":"1608.00213","created_at":"2026-05-18T00:54:19.957409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00213v1","created_at":"2026-05-18T00:54:19.957409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00213","created_at":"2026-05-18T00:54:19.957409+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWBQZCZVL75N","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWBQZCZVL75NPEY6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWBQZCZV","created_at":"2026-05-18T12:30:09.641336+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/BWBQZCZVL75NPEY6KSJYGN7526","json":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526.json","graph_json":"https://pith.science/api/pith-number/BWBQZCZVL75NPEY6KSJYGN7526/graph.json","events_json":"https://pith.science/api/pith-number/BWBQZCZVL75NPEY6KSJYGN7526/events.json","paper":"https://pith.science/paper/BWBQZCZV"},"agent_actions":{"view_html":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526","download_json":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526.json","view_paper":"https://pith.science/paper/BWBQZCZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00213&json=true","fetch_graph":"https://pith.science/api/pith-number/BWBQZCZVL75NPEY6KSJYGN7526/graph.json","fetch_events":"https://pith.science/api/pith-number/BWBQZCZVL75NPEY6KSJYGN7526/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/action/storage_attestation","attest_author":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/action/author_attestation","sign_citation":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/action/citation_signature","submit_replication":"https://pith.science/pith/BWBQZCZVL75NPEY6KSJYGN7526/action/replication_record"}},"created_at":"2026-05-18T00:54:19.957409+00:00","updated_at":"2026-05-18T00:54:19.957409+00:00"}