{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NXYIGTV53XGCPN6UBIEJURPAN5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"75f0459bb04dbef1d72cc11d5a6ca34cc70270f6ef2623396516baf7418326b0","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-30T21:54:59Z","title_canon_sha256":"fea3f183638405de9566b9bb6441ea837757123b4a4b6c9267e09692e6cc312d"},"schema_version":"1.0","source":{"id":"1305.0034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0034","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0034v1","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0034","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"NXYIGTV53XGC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NXYIGTV53XGCPN6U","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NXYIGTV5","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:7cd9537d3f585c91dbfd16bb602e35ca9f8cc6559683a8f88101e45b6495e09f","target":"graph","created_at":"2026-05-18T03:26:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In two-player zero-sum games, if both players minimize their average external regret, then the average of the strategy profiles converges to a Nash equilibrium. For n-player general-sum games, however, theoretical guarantees for regret minimization are less understood. Nonetheless, Counterfactual Regret Minimization (CFR), a popular regret minimization algorithm for extensive-form games, has generated winning three-player Texas Hold'em agents in the Annual Computer Poker Competition (ACPC). In this paper, we provide the first set of theoretical properties for regret minimization algorithms in ","authors_text":"Richard Gibson","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-30T21:54:59Z","title":"Regret Minimization in Non-Zero-Sum Games with Applications to Building Champion Multiplayer Computer Poker Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0034","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2b0cbef078400cf2e1133b0b0c8a2b686728d896cff19a4ffcbe5ecac89fc7ce","target":"record","created_at":"2026-05-18T03:26:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"75f0459bb04dbef1d72cc11d5a6ca34cc70270f6ef2623396516baf7418326b0","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-30T21:54:59Z","title_canon_sha256":"fea3f183638405de9566b9bb6441ea837757123b4a4b6c9267e09692e6cc312d"},"schema_version":"1.0","source":{"id":"1305.0034","kind":"arxiv","version":1}},"canonical_sha256":"6df0834ebdddcc27b7d40a089a45e06f6858bbed15a6c6318d4cd711b98bdb61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6df0834ebdddcc27b7d40a089a45e06f6858bbed15a6c6318d4cd711b98bdb61","first_computed_at":"2026-05-18T03:26:42.207838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:42.207838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3uT4JcxHObbnruZ0MVHmTJwfTcYaYxQ/etx9zjcjwAttRO7iGDheNht49NqeNCIswDuK9mEiHdXvtAVxbI+uAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:42.208486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b0cbef078400cf2e1133b0b0c8a2b686728d896cff19a4ffcbe5ecac89fc7ce","sha256:7cd9537d3f585c91dbfd16bb602e35ca9f8cc6559683a8f88101e45b6495e09f"],"state_sha256":"b5e9fcb1e4dd9e8c230f7dbad2500af3d9b4e2147f11de6bc67f136bd8342f40"}