{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BCYUBUHBE7MJPTI4YIY3GLPM7X","short_pith_number":"pith:BCYUBUHB","schema_version":"1.0","canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","source":{"kind":"arxiv","id":"1702.06439","version":1},"attestation_state":"computed","paper":{"title":"Admissibility in Concurrent Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Gilles Geeraerts, Jean-Fran\\c{c}ois Raskin, Nicolas Basset, Ocan Sankur","submitted_at":"2017-02-21T15:30:28Z","abstract_excerpt":"In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates it, i.e., that wins (almost surely) against a super set of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we characterise them precisely. Then, when the objectives of the players are omega-regular, we show how to perform assume-admissible synthesis, i.e., how to compute admissible strategies that win (almost s"},"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":"1702.06439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-21T15:30:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b3d6c6d38cfc2d05ffba3215f1c63f3a78381d17ae070dd681861bd77b1116d9","abstract_canon_sha256":"6e8e4319027acebed1c951b4ac59b90617f195a3aa6574e37fb916b13b6bbe18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.139672Z","signature_b64":"G8EIHxBrRcj8CrnRREEPzLLDMOcA46GNfYK3OOmijMaXeinrjJUisF8vFwJUiCNUVsIBf8W0BrT9loKlAzIdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","last_reissued_at":"2026-05-18T00:50:14.139206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.139206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Admissibility in Concurrent Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Gilles Geeraerts, Jean-Fran\\c{c}ois Raskin, Nicolas Basset, Ocan Sankur","submitted_at":"2017-02-21T15:30:28Z","abstract_excerpt":"In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates it, i.e., that wins (almost surely) against a super set of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we characterise them precisely. Then, when the objectives of the players are omega-regular, we show how to perform assume-admissible synthesis, i.e., how to compute admissible strategies that win (almost s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06439","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":"1702.06439","created_at":"2026-05-18T00:50:14.139279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06439v1","created_at":"2026-05-18T00:50:14.139279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06439","created_at":"2026-05-18T00:50:14.139279+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCYUBUHBE7MJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCYUBUHBE7MJPTI4","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCYUBUHB","created_at":"2026-05-18T12:31:08.081275+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/BCYUBUHBE7MJPTI4YIY3GLPM7X","json":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X.json","graph_json":"https://pith.science/api/pith-number/BCYUBUHBE7MJPTI4YIY3GLPM7X/graph.json","events_json":"https://pith.science/api/pith-number/BCYUBUHBE7MJPTI4YIY3GLPM7X/events.json","paper":"https://pith.science/paper/BCYUBUHB"},"agent_actions":{"view_html":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X","download_json":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X.json","view_paper":"https://pith.science/paper/BCYUBUHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06439&json=true","fetch_graph":"https://pith.science/api/pith-number/BCYUBUHBE7MJPTI4YIY3GLPM7X/graph.json","fetch_events":"https://pith.science/api/pith-number/BCYUBUHBE7MJPTI4YIY3GLPM7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/action/storage_attestation","attest_author":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/action/author_attestation","sign_citation":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/action/citation_signature","submit_replication":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/action/replication_record"}},"created_at":"2026-05-18T00:50:14.139279+00:00","updated_at":"2026-05-18T00:50:14.139279+00:00"}