{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UEQ2S7GEQPX4M4DEP2GNAAMXGB","short_pith_number":"pith:UEQ2S7GE","schema_version":"1.0","canonical_sha256":"a121a97cc483efc670647e8cd0019730518208fb5e79455f72d38a35dc2e0e91","source":{"kind":"arxiv","id":"1807.11914","version":1},"attestation_state":"computed","paper":{"title":"Computing the Strategy to Commit to in Polymatrix Games (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Alberto Marchesi, Giuseppe De Nittis, Nicola Gatti","submitted_at":"2018-07-31T16:50:19Z","abstract_excerpt":"Leadership games provide a powerful paradigm to model many real-world settings. Most literature focuses on games with a single follower who acts optimistically, breaking ties in favour of the leader. Unfortunately, for real-world applications, this is unlikely. In this paper, we look for efficiently solvable games with multiple followers who play either optimistically or pessimistically, i.e., breaking ties in favour or against the leader. We study the computational complexity of finding or approximating an optimistic or pessimistic leader-follower equilibrium in specific classes of succinct g"},"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":"1807.11914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-31T16:50:19Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"816b39051f6dc6479bfbf833d37fb75426ea19d096236f5c3d7cb6ad4d129b50","abstract_canon_sha256":"9685812c428f8bdacf2d757cd88fa6e146938c5a83394970ec14d36868a8864d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:20.766230Z","signature_b64":"VuiAr+ZcSvlwvJE1MZj9U17A9Fw84fy/Kwfg3V1q5Jq0Uz8JHbsc2nsFTbq/QWAJsOPeAJA7bCeNc+z3OL7xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a121a97cc483efc670647e8cd0019730518208fb5e79455f72d38a35dc2e0e91","last_reissued_at":"2026-05-18T00:09:20.765596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:20.765596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Strategy to Commit to in Polymatrix Games (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Alberto Marchesi, Giuseppe De Nittis, Nicola Gatti","submitted_at":"2018-07-31T16:50:19Z","abstract_excerpt":"Leadership games provide a powerful paradigm to model many real-world settings. Most literature focuses on games with a single follower who acts optimistically, breaking ties in favour of the leader. Unfortunately, for real-world applications, this is unlikely. In this paper, we look for efficiently solvable games with multiple followers who play either optimistically or pessimistically, i.e., breaking ties in favour or against the leader. We study the computational complexity of finding or approximating an optimistic or pessimistic leader-follower equilibrium in specific classes of succinct g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11914","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":"1807.11914","created_at":"2026-05-18T00:09:20.765683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11914v1","created_at":"2026-05-18T00:09:20.765683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11914","created_at":"2026-05-18T00:09:20.765683+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEQ2S7GEQPX4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEQ2S7GEQPX4M4DE","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEQ2S7GE","created_at":"2026-05-18T12:32:56.356000+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/UEQ2S7GEQPX4M4DEP2GNAAMXGB","json":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB.json","graph_json":"https://pith.science/api/pith-number/UEQ2S7GEQPX4M4DEP2GNAAMXGB/graph.json","events_json":"https://pith.science/api/pith-number/UEQ2S7GEQPX4M4DEP2GNAAMXGB/events.json","paper":"https://pith.science/paper/UEQ2S7GE"},"agent_actions":{"view_html":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB","download_json":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB.json","view_paper":"https://pith.science/paper/UEQ2S7GE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11914&json=true","fetch_graph":"https://pith.science/api/pith-number/UEQ2S7GEQPX4M4DEP2GNAAMXGB/graph.json","fetch_events":"https://pith.science/api/pith-number/UEQ2S7GEQPX4M4DEP2GNAAMXGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB/action/storage_attestation","attest_author":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB/action/author_attestation","sign_citation":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB/action/citation_signature","submit_replication":"https://pith.science/pith/UEQ2S7GEQPX4M4DEP2GNAAMXGB/action/replication_record"}},"created_at":"2026-05-18T00:09:20.765683+00:00","updated_at":"2026-05-18T00:09:20.765683+00:00"}