{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A3WNE6CX5U5XVPC4DTOHZUZWDB","short_pith_number":"pith:A3WNE6CX","schema_version":"1.0","canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","source":{"kind":"arxiv","id":"1310.8613","version":2},"attestation_state":"computed","paper":{"title":"Convergence of Monte Carlo Tree Search in Simultaneous Move Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bo\\v{s}ansk\\'y, Marc Lanctot, Viliam Lis\\'y, Vojt\\v{e}ch Kova\\v{r}\\'ik","submitted_at":"2013-10-31T17:41:51Z","abstract_excerpt":"We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is $\\epsilon$-Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS algorithm eventually converges to an approximate Nash equilibrium (NE) of the extensive-form game. We empirically evaluate this claim using regret matching and Exp3 as the selection methods on r"},"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":"1310.8613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-31T17:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"615ba47b441320f60e6f28371672ed0f7b3b06d118e034404530db30367db8d6","abstract_canon_sha256":"25c056ab9d86769ebc0c5385ba8f728975d5e3674fbb280fbca02e5a8aecdbba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:48.178310Z","signature_b64":"EXmiZwlOe+92q3Kl7lNXGYUHLKD3SHCOFwGfYlCJG+QMJHbLUQJf5Ye7IL3niPXN0MkWMYXzYPB+Sd3vTdPUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ecd27857ed3b7abc5c1cdc7cd3361879e1bfbc6ca8b2e186efd4f21e0cf651","last_reissued_at":"2026-05-18T03:04:48.177600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:48.177600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of Monte Carlo Tree Search in Simultaneous Move Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bo\\v{s}ansk\\'y, Marc Lanctot, Viliam Lis\\'y, Vojt\\v{e}ch Kova\\v{r}\\'ik","submitted_at":"2013-10-31T17:41:51Z","abstract_excerpt":"We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is $\\epsilon$-Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS algorithm eventually converges to an approximate Nash equilibrium (NE) of the extensive-form game. We empirically evaluate this claim using regret matching and Exp3 as the selection methods on r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8613","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":"1310.8613","created_at":"2026-05-18T03:04:48.177731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.8613v2","created_at":"2026-05-18T03:04:48.177731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8613","created_at":"2026-05-18T03:04:48.177731+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3WNE6CX5U5X","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3WNE6CX5U5XVPC4","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3WNE6CX","created_at":"2026-05-18T12:27:38.830355+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/A3WNE6CX5U5XVPC4DTOHZUZWDB","json":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB.json","graph_json":"https://pith.science/api/pith-number/A3WNE6CX5U5XVPC4DTOHZUZWDB/graph.json","events_json":"https://pith.science/api/pith-number/A3WNE6CX5U5XVPC4DTOHZUZWDB/events.json","paper":"https://pith.science/paper/A3WNE6CX"},"agent_actions":{"view_html":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB","download_json":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB.json","view_paper":"https://pith.science/paper/A3WNE6CX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.8613&json=true","fetch_graph":"https://pith.science/api/pith-number/A3WNE6CX5U5XVPC4DTOHZUZWDB/graph.json","fetch_events":"https://pith.science/api/pith-number/A3WNE6CX5U5XVPC4DTOHZUZWDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/action/storage_attestation","attest_author":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/action/author_attestation","sign_citation":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/action/citation_signature","submit_replication":"https://pith.science/pith/A3WNE6CX5U5XVPC4DTOHZUZWDB/action/replication_record"}},"created_at":"2026-05-18T03:04:48.177731+00:00","updated_at":"2026-05-18T03:04:48.177731+00:00"}