{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JRLPXI6MKDBL2P3MA3GCLB6Q32","short_pith_number":"pith:JRLPXI6M","schema_version":"1.0","canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","source":{"kind":"arxiv","id":"1905.06577","version":1},"attestation_state":"computed","paper":{"title":"A tutorial on Zero-sum Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"J\\'er\\^ome Renault (TSE)","submitted_at":"2019-05-16T07:43:47Z","abstract_excerpt":"Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state variable, and have opposite interests. These notes constitute a short mathematical introduction to the theory of such games. Section 1 presents the basic model with finitely many states and actions. We give proofs of the standard results concerning : the existence and formulas for the values of the n-stage games, of the $\\lambda$-discounted games, the convergence of"},"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":"1905.06577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-16T07:43:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"75db96d41c52d6a1c86457cf123b18eecd7ac8f46af5b2c2af29b6b3de2c3a7a","abstract_canon_sha256":"e77853c76703293f08fb251afa35d5e66d16bef805ef5bddfdedc20c0844b657"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:01.831789Z","signature_b64":"L5XsJlZ8tbp7/9Fsav1O+j5soPHzBLcMFxdNM92WpuCJ98o/u/VYaygUgWJVUfigh6cHfy2BlDGJgZ38QPYYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","last_reissued_at":"2026-05-17T23:46:01.831002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:01.831002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tutorial on Zero-sum Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"J\\'er\\^ome Renault (TSE)","submitted_at":"2019-05-16T07:43:47Z","abstract_excerpt":"Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state variable, and have opposite interests. These notes constitute a short mathematical introduction to the theory of such games. Section 1 presents the basic model with finitely many states and actions. We give proofs of the standard results concerning : the existence and formulas for the values of the n-stage games, of the $\\lambda$-discounted games, the convergence of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06577","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":"1905.06577","created_at":"2026-05-17T23:46:01.831145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06577v1","created_at":"2026-05-17T23:46:01.831145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06577","created_at":"2026-05-17T23:46:01.831145+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRLPXI6MKDBL","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRLPXI6MKDBL2P3M","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRLPXI6M","created_at":"2026-05-18T12:33:21.387695+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/JRLPXI6MKDBL2P3MA3GCLB6Q32","json":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32.json","graph_json":"https://pith.science/api/pith-number/JRLPXI6MKDBL2P3MA3GCLB6Q32/graph.json","events_json":"https://pith.science/api/pith-number/JRLPXI6MKDBL2P3MA3GCLB6Q32/events.json","paper":"https://pith.science/paper/JRLPXI6M"},"agent_actions":{"view_html":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32","download_json":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32.json","view_paper":"https://pith.science/paper/JRLPXI6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06577&json=true","fetch_graph":"https://pith.science/api/pith-number/JRLPXI6MKDBL2P3MA3GCLB6Q32/graph.json","fetch_events":"https://pith.science/api/pith-number/JRLPXI6MKDBL2P3MA3GCLB6Q32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/action/storage_attestation","attest_author":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/action/author_attestation","sign_citation":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/action/citation_signature","submit_replication":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/action/replication_record"}},"created_at":"2026-05-17T23:46:01.831145+00:00","updated_at":"2026-05-17T23:46:01.831145+00:00"}