{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ELIQ3EAGRCLMUBUYZHJ6HQKITR","short_pith_number":"pith:ELIQ3EAG","schema_version":"1.0","canonical_sha256":"22d10d90068896ca0698c9d3e3c1489c5a5e363dd462b74a965bd69723a6cbb1","source":{"kind":"arxiv","id":"1412.1412","version":3},"attestation_state":"computed","paper":{"title":"Zero-sum stopping games with asymmetric information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Christine Gr\\\"un (GREMAQ), Fabien Gensbittel (GREMAQ)","submitted_at":"2014-12-03T17:43:09Z","abstract_excerpt":"We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that the players have access to stopping times with respect to different filtrations. We show the existence of a value in mixed stopping times and provide a variational characterization for the value as a function of the initial distribution of the Markov chains. We also prove a verification theorem for optimal stopping rules which allows to construct optimal sto"},"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":"1412.1412","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-03T17:43:09Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"76aaa9267a4bba11d1aa07b5288622fc0a6f6fc807ef78a1e1842e40e8ee689d","abstract_canon_sha256":"d033124197217ba35563133c5ff27cf7946a52fdb7d3466c4adfd4be72501324"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:57.329611Z","signature_b64":"id162hfdXxJf+DR2KyugVxlK27ilW92BIikZWMuQZxBC+D+afWudyV4PpVqpuyv93BpF6NR0u4VBmPXFjLKUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22d10d90068896ca0698c9d3e3c1489c5a5e363dd462b74a965bd69723a6cbb1","last_reissued_at":"2026-05-18T00:28:57.328915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:57.328915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-sum stopping games with asymmetric information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Christine Gr\\\"un (GREMAQ), Fabien Gensbittel (GREMAQ)","submitted_at":"2014-12-03T17:43:09Z","abstract_excerpt":"We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that the players have access to stopping times with respect to different filtrations. We show the existence of a value in mixed stopping times and provide a variational characterization for the value as a function of the initial distribution of the Markov chains. We also prove a verification theorem for optimal stopping rules which allows to construct optimal sto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1412","kind":"arxiv","version":3},"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":"1412.1412","created_at":"2026-05-18T00:28:57.329006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1412v3","created_at":"2026-05-18T00:28:57.329006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1412","created_at":"2026-05-18T00:28:57.329006+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELIQ3EAGRCLM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELIQ3EAGRCLMUBUY","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELIQ3EAG","created_at":"2026-05-18T12:28:28.263976+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/ELIQ3EAGRCLMUBUYZHJ6HQKITR","json":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR.json","graph_json":"https://pith.science/api/pith-number/ELIQ3EAGRCLMUBUYZHJ6HQKITR/graph.json","events_json":"https://pith.science/api/pith-number/ELIQ3EAGRCLMUBUYZHJ6HQKITR/events.json","paper":"https://pith.science/paper/ELIQ3EAG"},"agent_actions":{"view_html":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR","download_json":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR.json","view_paper":"https://pith.science/paper/ELIQ3EAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1412&json=true","fetch_graph":"https://pith.science/api/pith-number/ELIQ3EAGRCLMUBUYZHJ6HQKITR/graph.json","fetch_events":"https://pith.science/api/pith-number/ELIQ3EAGRCLMUBUYZHJ6HQKITR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR/action/storage_attestation","attest_author":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR/action/author_attestation","sign_citation":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR/action/citation_signature","submit_replication":"https://pith.science/pith/ELIQ3EAGRCLMUBUYZHJ6HQKITR/action/replication_record"}},"created_at":"2026-05-18T00:28:57.329006+00:00","updated_at":"2026-05-18T00:28:57.329006+00:00"}