{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y3MXT2O6MCGO2P3HSUOAMJT3FG","short_pith_number":"pith:Y3MXT2O6","schema_version":"1.0","canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","source":{"kind":"arxiv","id":"1808.01438","version":1},"attestation_state":"computed","paper":{"title":"Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Nicola Gatti, Stefano Coniglio","submitted_at":"2018-08-04T07:05:49Z","abstract_excerpt":"The search problem of computing a \\textit{leader-follower equilibrium} has been widely investigated in the scientific literature in, almost exclusively, the single-follower setting. Although the \\textit{optimistic} and \\ textit{pessimistic} versions of the problem are solved with different methodologies, both cases allow for efficient, polynomial-time algorithms based on linear programming. The situation is different with multiple followers, where results are only sporadic and depend strictly on the nature of the followers' game. In this paper, we investigate the setting of a normal-form game "},"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":"1808.01438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-04T07:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"ad7749077b3baaaf8d9ac522abf0109e55d89441d3cf47639029a4e033ee85cb","abstract_canon_sha256":"f5372b4ae1b9d9d8caa30963dfb3e5a011a976d5d2fb6db62e804c5d97cfe939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:52.980898Z","signature_b64":"65zhS3LlDi5HSBoKSR2+FfBgVmS08m2Wyzs7B4C3gHI+3qbc0+2RX6p2e9+WsAJATYgqjd2JnBw19V+u9Y6DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d979e9de608ced3f67951c06267b2993e0c069a34f30dd868c5772ee6eca87","last_reissued_at":"2026-05-18T00:08:52.980227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:52.980227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Nicola Gatti, Stefano Coniglio","submitted_at":"2018-08-04T07:05:49Z","abstract_excerpt":"The search problem of computing a \\textit{leader-follower equilibrium} has been widely investigated in the scientific literature in, almost exclusively, the single-follower setting. Although the \\textit{optimistic} and \\ textit{pessimistic} versions of the problem are solved with different methodologies, both cases allow for efficient, polynomial-time algorithms based on linear programming. The situation is different with multiple followers, where results are only sporadic and depend strictly on the nature of the followers' game. In this paper, we investigate the setting of a normal-form game "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01438","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":"1808.01438","created_at":"2026-05-18T00:08:52.980343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01438v1","created_at":"2026-05-18T00:08:52.980343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01438","created_at":"2026-05-18T00:08:52.980343+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3MXT2O6MCGO","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3MXT2O6MCGO2P3H","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3MXT2O6","created_at":"2026-05-18T12:33:04.347982+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/Y3MXT2O6MCGO2P3HSUOAMJT3FG","json":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG.json","graph_json":"https://pith.science/api/pith-number/Y3MXT2O6MCGO2P3HSUOAMJT3FG/graph.json","events_json":"https://pith.science/api/pith-number/Y3MXT2O6MCGO2P3HSUOAMJT3FG/events.json","paper":"https://pith.science/paper/Y3MXT2O6"},"agent_actions":{"view_html":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG","download_json":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG.json","view_paper":"https://pith.science/paper/Y3MXT2O6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01438&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3MXT2O6MCGO2P3HSUOAMJT3FG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3MXT2O6MCGO2P3HSUOAMJT3FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/action/storage_attestation","attest_author":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/action/author_attestation","sign_citation":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/action/citation_signature","submit_replication":"https://pith.science/pith/Y3MXT2O6MCGO2P3HSUOAMJT3FG/action/replication_record"}},"created_at":"2026-05-18T00:08:52.980343+00:00","updated_at":"2026-05-18T00:08:52.980343+00:00"}