{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FUSCQG6MUO62TPGTWYNKDBX7H7","short_pith_number":"pith:FUSCQG6M","schema_version":"1.0","canonical_sha256":"2d24281bcca3bda9bcd3b61aa186ff3fc2766a881eda1461fea0bb0b293ac51a","source":{"kind":"arxiv","id":"1504.07518","version":1},"attestation_state":"computed","paper":{"title":"Efficient Equilibria in Polymatrix Coordination Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Guido Sch\\\"afer, Mona Rahn","submitted_at":"2015-04-28T15:03:30Z","abstract_excerpt":"We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study $\\alpha$-approximate $k$-equilibria of these games, i.e., outcomes where no group of at most $k$ players can deviate such that each member increases his payoff by at least a factor $\\alpha$. We prove that for $\\alpha \\ge 2$ these games have the finite coalitional improvement property (and thus $\\alpha$-approximate $k$-equilibria exist), while for $\\alpha < 2$ t"},"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":"1504.07518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-28T15:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"af3e97f4f586a60569562a5c9b623703df2a8a10edf4a1e328046ca5a09fa7b7","abstract_canon_sha256":"351efd3a0323a9af296be1e394903299053c481714b9b8a233aae4d631a602ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:34.503347Z","signature_b64":"xLbjZ8R4E8OPhcC4WiZ79ec7Gk5Xpu+W7O9X4Ry5sju9hl+/8s+b+4B8/bjQMqkgjk59eKglJIar/x7hz/feAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d24281bcca3bda9bcd3b61aa186ff3fc2766a881eda1461fea0bb0b293ac51a","last_reissued_at":"2026-05-18T02:17:34.502750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:34.502750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Equilibria in Polymatrix Coordination Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Guido Sch\\\"afer, Mona Rahn","submitted_at":"2015-04-28T15:03:30Z","abstract_excerpt":"We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study $\\alpha$-approximate $k$-equilibria of these games, i.e., outcomes where no group of at most $k$ players can deviate such that each member increases his payoff by at least a factor $\\alpha$. We prove that for $\\alpha \\ge 2$ these games have the finite coalitional improvement property (and thus $\\alpha$-approximate $k$-equilibria exist), while for $\\alpha < 2$ t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07518","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":"1504.07518","created_at":"2026-05-18T02:17:34.502847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07518v1","created_at":"2026-05-18T02:17:34.502847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07518","created_at":"2026-05-18T02:17:34.502847+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUSCQG6MUO62","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUSCQG6MUO62TPGT","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUSCQG6M","created_at":"2026-05-18T12:29:22.688609+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/FUSCQG6MUO62TPGTWYNKDBX7H7","json":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7.json","graph_json":"https://pith.science/api/pith-number/FUSCQG6MUO62TPGTWYNKDBX7H7/graph.json","events_json":"https://pith.science/api/pith-number/FUSCQG6MUO62TPGTWYNKDBX7H7/events.json","paper":"https://pith.science/paper/FUSCQG6M"},"agent_actions":{"view_html":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7","download_json":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7.json","view_paper":"https://pith.science/paper/FUSCQG6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07518&json=true","fetch_graph":"https://pith.science/api/pith-number/FUSCQG6MUO62TPGTWYNKDBX7H7/graph.json","fetch_events":"https://pith.science/api/pith-number/FUSCQG6MUO62TPGTWYNKDBX7H7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7/action/storage_attestation","attest_author":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7/action/author_attestation","sign_citation":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7/action/citation_signature","submit_replication":"https://pith.science/pith/FUSCQG6MUO62TPGTWYNKDBX7H7/action/replication_record"}},"created_at":"2026-05-18T02:17:34.502847+00:00","updated_at":"2026-05-18T02:17:34.502847+00:00"}