{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N4KHNVUJW6ELYDA5ZVROFLSDM6","short_pith_number":"pith:N4KHNVUJ","schema_version":"1.0","canonical_sha256":"6f1476d689b788bc0c1dcd62e2ae436784be79a8c29b4df14785a03cb0c04e92","source":{"kind":"arxiv","id":"1507.07677","version":3},"attestation_state":"computed","paper":{"title":"Computation of Stackelberg Equilibria of Finite Sequential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Branislav Bosansky, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Simina Branzei, Troels Bjerre Sorensen","submitted_at":"2015-07-28T08:16:56Z","abstract_excerpt":"The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken in favor of the leader). We study Stackelberg equilibria in finite sequential games (or extensive-form games) and provide new exact algorithms, approximate algorithms, and hardness results for several classes of these sequential games."},"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":"1507.07677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-28T08:16:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"17d6ec0d0da10c5c2ce1fdf4034da255be3d78daf20b4e31dc2b8b09c05ffab7","abstract_canon_sha256":"c7e7bf994c09227150608106146109b30772c51cb9fdad1a166703e7f38caddc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:21.095303Z","signature_b64":"SfXQSJh9DAT+6wgVHTl/WvYxg4CLLvC2nA/sppVCNdJekyyaoAzpT7cP5GVJhIrHrmVSowb0l9gspwJ0VqmWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1476d689b788bc0c1dcd62e2ae436784be79a8c29b4df14785a03cb0c04e92","last_reissued_at":"2026-05-18T01:08:21.094587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:21.094587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation of Stackelberg Equilibria of Finite Sequential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Branislav Bosansky, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Simina Branzei, Troels Bjerre Sorensen","submitted_at":"2015-07-28T08:16:56Z","abstract_excerpt":"The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken in favor of the leader). We study Stackelberg equilibria in finite sequential games (or extensive-form games) and provide new exact algorithms, approximate algorithms, and hardness results for several classes of these sequential games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07677","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":"1507.07677","created_at":"2026-05-18T01:08:21.094703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07677v3","created_at":"2026-05-18T01:08:21.094703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07677","created_at":"2026-05-18T01:08:21.094703+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4KHNVUJW6EL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4KHNVUJW6ELYDA5","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4KHNVUJ","created_at":"2026-05-18T12:29:32.376354+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/N4KHNVUJW6ELYDA5ZVROFLSDM6","json":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6.json","graph_json":"https://pith.science/api/pith-number/N4KHNVUJW6ELYDA5ZVROFLSDM6/graph.json","events_json":"https://pith.science/api/pith-number/N4KHNVUJW6ELYDA5ZVROFLSDM6/events.json","paper":"https://pith.science/paper/N4KHNVUJ"},"agent_actions":{"view_html":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6","download_json":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6.json","view_paper":"https://pith.science/paper/N4KHNVUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07677&json=true","fetch_graph":"https://pith.science/api/pith-number/N4KHNVUJW6ELYDA5ZVROFLSDM6/graph.json","fetch_events":"https://pith.science/api/pith-number/N4KHNVUJW6ELYDA5ZVROFLSDM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6/action/storage_attestation","attest_author":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6/action/author_attestation","sign_citation":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6/action/citation_signature","submit_replication":"https://pith.science/pith/N4KHNVUJW6ELYDA5ZVROFLSDM6/action/replication_record"}},"created_at":"2026-05-18T01:08:21.094703+00:00","updated_at":"2026-05-18T01:08:21.094703+00:00"}