{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JE3ARZFFOE5UXETOQNPJKLKC5K","short_pith_number":"pith:JE3ARZFF","schema_version":"1.0","canonical_sha256":"493608e4a5713b4b926e835e952d42eaa578e8800c665ebca65cae2422c4b85a","source":{"kind":"arxiv","id":"1403.1385","version":2},"attestation_state":"computed","paper":{"title":"Dynamical Analysis of a Repeated Game with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.PR"],"primary_cat":"math.OC","authors_text":"Anthony Quas, Xavier Bressaud (IMT)","submitted_at":"2014-03-06T09:46:18Z","abstract_excerpt":"We study a two player repeated zero-sum game with asymmetric information introduced by Renault in which the underlying state of the game undergoes Markov evolution (parameterized by a transition probability $\\frac 12\\le p\\le 1$). H\\\"orner, Rosenberg, Solan and Vieille identified an optimal strategy, $\\sigma^*$ for the informed player for $p$ in the range $[\\frac 12,\\frac 23]$. We extend the range on which $\\sigma^*$ is proved to be optimal to about $[\\frac 12,0.719]$ and prove that it fails to be optimal at a value around 0.7328. Our techniques make use of tools from dynamical systems, specifi"},"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":"1403.1385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-06T09:46:18Z","cross_cats_sorted":["math.DS","math.PR"],"title_canon_sha256":"0e2ea3685f47e658d91b815497778357091faa21598370c2ea5bb4be69b1bc2e","abstract_canon_sha256":"55c483d69b509d351cda0fd5002de7b27324e2c671c4dc309b9d169238c8b3cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.482246Z","signature_b64":"Z1CFxLfGbD6hiCRNJC6S0cuxHXo9iSdPSrBHRevIdMXzoGMXCxTDmQufCkyCqTZ9WgutwCqai+AWMpryclQSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"493608e4a5713b4b926e835e952d42eaa578e8800c665ebca65cae2422c4b85a","last_reissued_at":"2026-05-18T00:48:43.481744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.481744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamical Analysis of a Repeated Game with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.PR"],"primary_cat":"math.OC","authors_text":"Anthony Quas, Xavier Bressaud (IMT)","submitted_at":"2014-03-06T09:46:18Z","abstract_excerpt":"We study a two player repeated zero-sum game with asymmetric information introduced by Renault in which the underlying state of the game undergoes Markov evolution (parameterized by a transition probability $\\frac 12\\le p\\le 1$). H\\\"orner, Rosenberg, Solan and Vieille identified an optimal strategy, $\\sigma^*$ for the informed player for $p$ in the range $[\\frac 12,\\frac 23]$. We extend the range on which $\\sigma^*$ is proved to be optimal to about $[\\frac 12,0.719]$ and prove that it fails to be optimal at a value around 0.7328. Our techniques make use of tools from dynamical systems, specifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1385","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":"1403.1385","created_at":"2026-05-18T00:48:43.481813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1385v2","created_at":"2026-05-18T00:48:43.481813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1385","created_at":"2026-05-18T00:48:43.481813+00:00"},{"alias_kind":"pith_short_12","alias_value":"JE3ARZFFOE5U","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JE3ARZFFOE5UXETO","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JE3ARZFF","created_at":"2026-05-18T12:28:33.132498+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/JE3ARZFFOE5UXETOQNPJKLKC5K","json":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K.json","graph_json":"https://pith.science/api/pith-number/JE3ARZFFOE5UXETOQNPJKLKC5K/graph.json","events_json":"https://pith.science/api/pith-number/JE3ARZFFOE5UXETOQNPJKLKC5K/events.json","paper":"https://pith.science/paper/JE3ARZFF"},"agent_actions":{"view_html":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K","download_json":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K.json","view_paper":"https://pith.science/paper/JE3ARZFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1385&json=true","fetch_graph":"https://pith.science/api/pith-number/JE3ARZFFOE5UXETOQNPJKLKC5K/graph.json","fetch_events":"https://pith.science/api/pith-number/JE3ARZFFOE5UXETOQNPJKLKC5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K/action/storage_attestation","attest_author":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K/action/author_attestation","sign_citation":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K/action/citation_signature","submit_replication":"https://pith.science/pith/JE3ARZFFOE5UXETOQNPJKLKC5K/action/replication_record"}},"created_at":"2026-05-18T00:48:43.481813+00:00","updated_at":"2026-05-18T00:48:43.481813+00:00"}