{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R7HE4FNUGG7CRZ7RM6JALSYVOU","short_pith_number":"pith:R7HE4FNU","schema_version":"1.0","canonical_sha256":"8fce4e15b431be28e7f1679205cb15751cd43c86861c019fd1af9a14c2f05445","source":{"kind":"arxiv","id":"1905.13108","version":1},"attestation_state":"computed","paper":{"title":"Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Matteo Castiglioni, Nicola Gatti","submitted_at":"2019-05-30T15:36:59Z","abstract_excerpt":"We study the problem of finding Stackelberg equilibria in games with a massive number of players. So far, the only known game instances in which the problem is solved in polynomial time are some particular congestion games. However, a complete characterization of hard and easy instances is still lacking. In this paper, we extend the state of the art along two main directions. First, we focus on games where players' actions are made of multiple resources, and we prove that the problem is NP-hard and not in Poly-APX unless P = NP, even in the basic case in which players are symmetric, their acti"},"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":"1905.13108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-30T15:36:59Z","cross_cats_sorted":[],"title_canon_sha256":"03d985037bcbc79b07176eeba53b7a6a4bf00cde2e14fa48eb537d25071baf3c","abstract_canon_sha256":"09f1ee2c3567b092a3ec82f3fd9b7f71e0fa48da2ac2c72ec74457a8b15335f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.902356Z","signature_b64":"A3aS4X/KVelhtr692AImIyw/n1gytrtKUx0zmkksVdhC/5tKu+nuO+du7+AC/XSpTJ70oEmu0bLHT/MhOK3gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fce4e15b431be28e7f1679205cb15751cd43c86861c019fd1af9a14c2f05445","last_reissued_at":"2026-05-17T23:44:38.901762Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.901762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Matteo Castiglioni, Nicola Gatti","submitted_at":"2019-05-30T15:36:59Z","abstract_excerpt":"We study the problem of finding Stackelberg equilibria in games with a massive number of players. So far, the only known game instances in which the problem is solved in polynomial time are some particular congestion games. However, a complete characterization of hard and easy instances is still lacking. In this paper, we extend the state of the art along two main directions. First, we focus on games where players' actions are made of multiple resources, and we prove that the problem is NP-hard and not in Poly-APX unless P = NP, even in the basic case in which players are symmetric, their acti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13108","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":"1905.13108","created_at":"2026-05-17T23:44:38.901850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13108v1","created_at":"2026-05-17T23:44:38.901850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13108","created_at":"2026-05-17T23:44:38.901850+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7HE4FNUGG7C","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7HE4FNUGG7CRZ7R","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7HE4FNU","created_at":"2026-05-18T12:33:27.125529+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/R7HE4FNUGG7CRZ7RM6JALSYVOU","json":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU.json","graph_json":"https://pith.science/api/pith-number/R7HE4FNUGG7CRZ7RM6JALSYVOU/graph.json","events_json":"https://pith.science/api/pith-number/R7HE4FNUGG7CRZ7RM6JALSYVOU/events.json","paper":"https://pith.science/paper/R7HE4FNU"},"agent_actions":{"view_html":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU","download_json":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU.json","view_paper":"https://pith.science/paper/R7HE4FNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13108&json=true","fetch_graph":"https://pith.science/api/pith-number/R7HE4FNUGG7CRZ7RM6JALSYVOU/graph.json","fetch_events":"https://pith.science/api/pith-number/R7HE4FNUGG7CRZ7RM6JALSYVOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU/action/storage_attestation","attest_author":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU/action/author_attestation","sign_citation":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU/action/citation_signature","submit_replication":"https://pith.science/pith/R7HE4FNUGG7CRZ7RM6JALSYVOU/action/replication_record"}},"created_at":"2026-05-17T23:44:38.901850+00:00","updated_at":"2026-05-17T23:44:38.901850+00:00"}