{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4XICZQ3QEGKD77G3TVIE3MVEFF","short_pith_number":"pith:4XICZQ3Q","schema_version":"1.0","canonical_sha256":"e5d02cc37021943ffcdb9d504db2a4295e2f60582fb959b9a230743c931e7147","source":{"kind":"arxiv","id":"2509.08161","version":1},"attestation_state":"computed","paper":{"title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"April Niu, Juba Ziani, Kai Wang","submitted_at":"2025-09-09T21:46:22Z","abstract_excerpt":"In this work, we propose the first fully first-order method to compute an epsilon stationary Stackelberg equilibrium with convergence guarantees. To achieve this, we first reframe the leader follower interaction as single level constrained optimization. Second, we define the Lagrangian and show that it can approximate the leaders gradient in response to the equilibrium reached by followers with only first-order gradient evaluations. These findings suggest a fully first order algorithm that alternates between (i) approximating followers best responses through gradient descent and (ii) updating "},"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":"2509.08161","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-09T21:46:22Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"028ad4e65beb957f5c38c75540a83ef788cc73aaed0cfa06786c97da9cff2c77","abstract_canon_sha256":"edf2c10e21f2e545831a79dc51b1029da66deb306a9b37dcf87eb4b9b656ce02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:24.075028Z","signature_b64":"mn6HWnuBtCmze1cGwQnQrXme2Y0PcPNVrOLDfQDET0HiJx48QzW/CGD9eLAK1wHLc4klziAgrPjEvAv+BG+yCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5d02cc37021943ffcdb9d504db2a4295e2f60582fb959b9a230743c931e7147","last_reissued_at":"2026-07-05T12:08:24.074511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:24.074511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"April Niu, Juba Ziani, Kai Wang","submitted_at":"2025-09-09T21:46:22Z","abstract_excerpt":"In this work, we propose the first fully first-order method to compute an epsilon stationary Stackelberg equilibrium with convergence guarantees. To achieve this, we first reframe the leader follower interaction as single level constrained optimization. Second, we define the Lagrangian and show that it can approximate the leaders gradient in response to the equilibrium reached by followers with only first-order gradient evaluations. These findings suggest a fully first order algorithm that alternates between (i) approximating followers best responses through gradient descent and (ii) updating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08161","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/2509.08161/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":"2509.08161","created_at":"2026-07-05T12:08:24.074575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08161v1","created_at":"2026-07-05T12:08:24.074575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08161","created_at":"2026-07-05T12:08:24.074575+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XICZQ3QEGKD","created_at":"2026-07-05T12:08:24.074575+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XICZQ3QEGKD77G3","created_at":"2026-07-05T12:08:24.074575+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XICZQ3Q","created_at":"2026-07-05T12:08:24.074575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12167","citing_title":"Shared Infrastructure Investment and Pricing: Stackelberg Equilibria in Risk-Aware Take-or-Pay Contracts","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10226","citing_title":"Continuity of VaR and Continuous Differentiability of CVaR under Decision-Dependent Losses","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04394","citing_title":"Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF","json":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF.json","graph_json":"https://pith.science/api/pith-number/4XICZQ3QEGKD77G3TVIE3MVEFF/graph.json","events_json":"https://pith.science/api/pith-number/4XICZQ3QEGKD77G3TVIE3MVEFF/events.json","paper":"https://pith.science/paper/4XICZQ3Q"},"agent_actions":{"view_html":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF","download_json":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF.json","view_paper":"https://pith.science/paper/4XICZQ3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08161&json=true","fetch_graph":"https://pith.science/api/pith-number/4XICZQ3QEGKD77G3TVIE3MVEFF/graph.json","fetch_events":"https://pith.science/api/pith-number/4XICZQ3QEGKD77G3TVIE3MVEFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF/action/storage_attestation","attest_author":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF/action/author_attestation","sign_citation":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF/action/citation_signature","submit_replication":"https://pith.science/pith/4XICZQ3QEGKD77G3TVIE3MVEFF/action/replication_record"}},"created_at":"2026-07-05T12:08:24.074575+00:00","updated_at":"2026-07-05T12:08:24.074575+00:00"}