{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NXYIGTV53XGCPN6UBIEJURPAN5","short_pith_number":"pith:NXYIGTV5","schema_version":"1.0","canonical_sha256":"6df0834ebdddcc27b7d40a089a45e06f6858bbed15a6c6318d4cd711b98bdb61","source":{"kind":"arxiv","id":"1305.0034","version":1},"attestation_state":"computed","paper":{"title":"Regret Minimization in Non-Zero-Sum Games with Applications to Building Champion Multiplayer Computer Poker Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Richard Gibson","submitted_at":"2013-04-30T21:54:59Z","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 "},"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":"1305.0034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-30T21:54:59Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"fea3f183638405de9566b9bb6441ea837757123b4a4b6c9267e09692e6cc312d","abstract_canon_sha256":"75f0459bb04dbef1d72cc11d5a6ca34cc70270f6ef2623396516baf7418326b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:42.208486Z","signature_b64":"3uT4JcxHObbnruZ0MVHmTJwfTcYaYxQ/etx9zjcjwAttRO7iGDheNht49NqeNCIswDuK9mEiHdXvtAVxbI+uAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6df0834ebdddcc27b7d40a089a45e06f6858bbed15a6c6318d4cd711b98bdb61","last_reissued_at":"2026-05-18T03:26:42.207838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:42.207838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret Minimization in Non-Zero-Sum Games with Applications to Building Champion Multiplayer Computer Poker Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Richard Gibson","submitted_at":"2013-04-30T21:54:59Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0034","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":"1305.0034","created_at":"2026-05-18T03:26:42.207943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0034v1","created_at":"2026-05-18T03:26:42.207943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0034","created_at":"2026-05-18T03:26:42.207943+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXYIGTV53XGC","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXYIGTV53XGCPN6U","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXYIGTV5","created_at":"2026-05-18T12:27:52.871228+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/NXYIGTV53XGCPN6UBIEJURPAN5","json":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5.json","graph_json":"https://pith.science/api/pith-number/NXYIGTV53XGCPN6UBIEJURPAN5/graph.json","events_json":"https://pith.science/api/pith-number/NXYIGTV53XGCPN6UBIEJURPAN5/events.json","paper":"https://pith.science/paper/NXYIGTV5"},"agent_actions":{"view_html":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5","download_json":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5.json","view_paper":"https://pith.science/paper/NXYIGTV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0034&json=true","fetch_graph":"https://pith.science/api/pith-number/NXYIGTV53XGCPN6UBIEJURPAN5/graph.json","fetch_events":"https://pith.science/api/pith-number/NXYIGTV53XGCPN6UBIEJURPAN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5/action/storage_attestation","attest_author":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5/action/author_attestation","sign_citation":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5/action/citation_signature","submit_replication":"https://pith.science/pith/NXYIGTV53XGCPN6UBIEJURPAN5/action/replication_record"}},"created_at":"2026-05-18T03:26:42.207943+00:00","updated_at":"2026-05-18T03:26:42.207943+00:00"}