{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L5GGYVNH5AR6AW6DTSKSNDKYSS","short_pith_number":"pith:L5GGYVNH","schema_version":"1.0","canonical_sha256":"5f4c6c55a7e823e05bc39c95268d5894b652a4781fa64e3a1f3e7fb78bc42410","source":{"kind":"arxiv","id":"1906.01217","version":3},"attestation_state":"computed","paper":{"title":"Convergence of Learning Dynamics in Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Benjamin Chasnov, Lillian J. Ratliff, Tanner Fiez","submitted_at":"2019-06-04T06:27:34Z","abstract_excerpt":"This paper investigates the convergence of learning dynamics in Stackelberg games. In the class of games we consider, there is a hierarchical game being played between a leader and a follower with continuous action spaces. We establish a number of connections between the Nash and Stackelberg equilibrium concepts and characterize conditions under which attracting critical points of simultaneous gradient descent are Stackelberg equilibria in zero-sum games. Moreover, we show that the only stable critical points of the Stackelberg gradient dynamics are Stackelberg equilibria in zero-sum games. Us"},"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":"1906.01217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-04T06:27:34Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"8972d1c63f707dd362716bfee8e29f855cf8d5c3165d15e3ccdb812814f49eae","abstract_canon_sha256":"f90f10bd239ab8698aed120727b1b5d1f80a742d2c762989654bdae087c4823f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:04.293173Z","signature_b64":"WpLnW/aF/O3I/cZ0OYMGgTzdWUaTbQ22b8UvcC7xEkDDt1ipu+5BcBcsGbbFHuvXjkmIe1HC32A7UqoT9GAnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f4c6c55a7e823e05bc39c95268d5894b652a4781fa64e3a1f3e7fb78bc42410","last_reissued_at":"2026-07-05T09:45:04.292681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:04.292681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of Learning Dynamics in Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Benjamin Chasnov, Lillian J. Ratliff, Tanner Fiez","submitted_at":"2019-06-04T06:27:34Z","abstract_excerpt":"This paper investigates the convergence of learning dynamics in Stackelberg games. In the class of games we consider, there is a hierarchical game being played between a leader and a follower with continuous action spaces. We establish a number of connections between the Nash and Stackelberg equilibrium concepts and characterize conditions under which attracting critical points of simultaneous gradient descent are Stackelberg equilibria in zero-sum games. Moreover, we show that the only stable critical points of the Stackelberg gradient dynamics are Stackelberg equilibria in zero-sum games. Us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01217","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.01217/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":"1906.01217","created_at":"2026-07-05T09:45:04.292735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01217v3","created_at":"2026-07-05T09:45:04.292735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01217","created_at":"2026-07-05T09:45:04.292735+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5GGYVNH5AR6","created_at":"2026-07-05T09:45:04.292735+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5GGYVNH5AR6AW6D","created_at":"2026-07-05T09:45:04.292735+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5GGYVNH","created_at":"2026-07-05T09:45:04.292735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06624","citing_title":"Principles and Practice of Deep Representation Learning: or a Mathematical Theory of Memory","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09363","citing_title":"Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions","ref_index":115,"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":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS","json":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS.json","graph_json":"https://pith.science/api/pith-number/L5GGYVNH5AR6AW6DTSKSNDKYSS/graph.json","events_json":"https://pith.science/api/pith-number/L5GGYVNH5AR6AW6DTSKSNDKYSS/events.json","paper":"https://pith.science/paper/L5GGYVNH"},"agent_actions":{"view_html":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS","download_json":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS.json","view_paper":"https://pith.science/paper/L5GGYVNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01217&json=true","fetch_graph":"https://pith.science/api/pith-number/L5GGYVNH5AR6AW6DTSKSNDKYSS/graph.json","fetch_events":"https://pith.science/api/pith-number/L5GGYVNH5AR6AW6DTSKSNDKYSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS/action/storage_attestation","attest_author":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS/action/author_attestation","sign_citation":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS/action/citation_signature","submit_replication":"https://pith.science/pith/L5GGYVNH5AR6AW6DTSKSNDKYSS/action/replication_record"}},"created_at":"2026-07-05T09:45:04.292735+00:00","updated_at":"2026-07-05T09:45:04.292735+00:00"}