{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PUUVL3RN6BMOHPLWHVWNLNBMOO","short_pith_number":"pith:PUUVL3RN","schema_version":"1.0","canonical_sha256":"7d2955ee2df058e3bd763d6cd5b42c73af932c860538c97461a18571f7142a73","source":{"kind":"arxiv","id":"2211.13847","version":1},"attestation_state":"computed","paper":{"title":"Zero-Sum Stochastic Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Amy Greenwald, Denizalp Goktas, Jiayi Zhao","submitted_at":"2022-11-25T01:09:56Z","abstract_excerpt":"Zero-sum stochastic games have found important applications in a variety of fields, from machine learning to economics. Work on this model has primarily focused on the computation of Nash equilibrium due to its effectiveness in solving adversarial board and video games. Unfortunately, a Nash equilibrium is not guaranteed to exist in zero-sum stochastic games when the payoffs at each state are not convex-concave in the players' actions. A Stackelberg equilibrium, however, is guaranteed to exist. Consequently, in this paper, we study zero-sum stochastic Stackelberg games. Going beyond known exis"},"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":"2211.13847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-25T01:09:56Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"5e9b273575062be01d87797c510762f9a0b9f56626a3b06ef533c8a705e8036f","abstract_canon_sha256":"7db4c7665b30392804aa0e9908edda8e54d22eb976bd98b94d2550dc1923d305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:26.870711Z","signature_b64":"g98+jA4ZRyG2lw+RhsUHt7orj3yREfYbBCIG4kppnOSRvpXmrcYbluLLdq1xx51Cqd3AYRaTWS53/xIPjsA9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d2955ee2df058e3bd763d6cd5b42c73af932c860538c97461a18571f7142a73","last_reissued_at":"2026-07-05T05:19:26.870277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:26.870277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-Sum Stochastic Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Amy Greenwald, Denizalp Goktas, Jiayi Zhao","submitted_at":"2022-11-25T01:09:56Z","abstract_excerpt":"Zero-sum stochastic games have found important applications in a variety of fields, from machine learning to economics. Work on this model has primarily focused on the computation of Nash equilibrium due to its effectiveness in solving adversarial board and video games. Unfortunately, a Nash equilibrium is not guaranteed to exist in zero-sum stochastic games when the payoffs at each state are not convex-concave in the players' actions. A Stackelberg equilibrium, however, is guaranteed to exist. Consequently, in this paper, we study zero-sum stochastic Stackelberg games. Going beyond known exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.13847","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.13847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.13847","created_at":"2026-07-05T05:19:26.870342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.13847v1","created_at":"2026-07-05T05:19:26.870342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13847","created_at":"2026-07-05T05:19:26.870342+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUUVL3RN6BMO","created_at":"2026-07-05T05:19:26.870342+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUUVL3RN6BMOHPLW","created_at":"2026-07-05T05:19:26.870342+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUUVL3RN","created_at":"2026-07-05T05:19:26.870342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15568","citing_title":"Is Learning Effective in Dynamic Strategic Interactions? Evidence from Stackelberg Games","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO","json":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO.json","graph_json":"https://pith.science/api/pith-number/PUUVL3RN6BMOHPLWHVWNLNBMOO/graph.json","events_json":"https://pith.science/api/pith-number/PUUVL3RN6BMOHPLWHVWNLNBMOO/events.json","paper":"https://pith.science/paper/PUUVL3RN"},"agent_actions":{"view_html":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO","download_json":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO.json","view_paper":"https://pith.science/paper/PUUVL3RN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.13847&json=true","fetch_graph":"https://pith.science/api/pith-number/PUUVL3RN6BMOHPLWHVWNLNBMOO/graph.json","fetch_events":"https://pith.science/api/pith-number/PUUVL3RN6BMOHPLWHVWNLNBMOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO/action/storage_attestation","attest_author":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO/action/author_attestation","sign_citation":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO/action/citation_signature","submit_replication":"https://pith.science/pith/PUUVL3RN6BMOHPLWHVWNLNBMOO/action/replication_record"}},"created_at":"2026-07-05T05:19:26.870342+00:00","updated_at":"2026-07-05T05:19:26.870342+00:00"}