{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YI6ODTLDHTCQ2NWXXRNRXKPDI2","short_pith_number":"pith:YI6ODTLD","canonical_record":{"source":{"id":"2605.12555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-11T12:00:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"c4586bc3129a7d398f8d3cc4794cd96fd5395be9c969d76d4e91a4e4aafabf41","abstract_canon_sha256":"02c6b6054327cdbfc335de78e18242affb2f67baa6fed6c151a1b154a8a1c57b"},"schema_version":"1.0"},"canonical_sha256":"c23ce1cd633cc50d36d7bc5b1ba9e34696a3888045a5da3051dd49eb88143e08","source":{"kind":"arxiv","id":"2605.12555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12555","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12555v1","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12555","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"YI6ODTLDHTCQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YI6ODTLDHTCQ2NWX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YI6ODTLD","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YI6ODTLDHTCQ2NWXXRNRXKPDI2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-11T12:00:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"c4586bc3129a7d398f8d3cc4794cd96fd5395be9c969d76d4e91a4e4aafabf41","abstract_canon_sha256":"02c6b6054327cdbfc335de78e18242affb2f67baa6fed6c151a1b154a8a1c57b"},"schema_version":"1.0"},"canonical_sha256":"c23ce1cd633cc50d36d7bc5b1ba9e34696a3888045a5da3051dd49eb88143e08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:02.069807Z","signature_b64":"4LGXLzx5nSV9/KOS4jw0YyTPRy6tiYy5eBYJqE7NC22crXUvwMUrbsYN23d952H+vf7F2hSiyXpH5Sl5Ic2TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c23ce1cd633cc50d36d7bc5b1ba9e34696a3888045a5da3051dd49eb88143e08","last_reissued_at":"2026-05-18T03:10:02.069195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:02.069195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12555","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLDx13XytLdQCeP5JeZ6D9EGTAlcvhcMlq+/QVHUvEvcx2xghg5liUHcDpitD+q8F2y7lXzVMWrQOs5yEBdyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:44:10.550750Z"},"content_sha256":"b50e39b928a36f6e9999c5d25b340150e8f140c6799868553483b684b4d05671","schema_version":"1.0","event_id":"sha256:b50e39b928a36f6e9999c5d25b340150e8f140c6799868553483b684b4d05671"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YI6ODTLDHTCQ2NWXXRNRXKPDI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DelAC: A Multi-agent Reinforcement Learning of Team-Symmetric Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Team-symmetric stochastic games always have a team-symmetric Nash equilibrium that a new actor-critic algorithm can locate efficiently.","cross_cats":["cs.GT"],"primary_cat":"cs.MA","authors_text":"Duan-Shin Lee, Yu-Hsiu Hung","submitted_at":"2026-05-11T12:00:27Z","abstract_excerpt":"In this paper we study team-symmetric games with $m\\ge 2$ teams. Players within a team have symmetric identity and have a common payoff function. We show that team-symmetric games always have a team-symmetric Nash equilibrium. We develop and solve a linear complementarity problem of team-symmetric Nash equilibria. We propose an actor-critic based multi-agent reinforcement learning algorithm for team-symmetric games. Through simulations, we show that this multi-agent reinforcement learning algorithm performs much better than many existing algorithms."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that team-symmetric games always have a team-symmetric Nash equilibrium. We develop and solve a linear complementarity problem of team-symmetric Nash equilibria. ... this multi-agent reinforcement learning algorithm performs much better than many existing algorithms.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that players within a team have perfectly symmetric identities and identical payoff functions holds in the target applications, and that simulation results generalize beyond the tested environments.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Team-symmetric games always have team-symmetric Nash equilibria solvable via linear complementarity problems, and the DelAC actor-critic MARL algorithm outperforms existing methods in simulations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Team-symmetric stochastic games always have a team-symmetric Nash equilibrium that a new actor-critic algorithm can locate efficiently.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b5e3331057af1c7ef5f956f3b5a84f3d1e9ed21ceda2e4707bdb593055deb739"},"source":{"id":"2605.12555","kind":"arxiv","version":1},"verdict":{"id":"dc81200c-9ceb-4bb6-afae-c83033e6f981","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:26:41.584151Z","strongest_claim":"We show that team-symmetric games always have a team-symmetric Nash equilibrium. We develop and solve a linear complementarity problem of team-symmetric Nash equilibria. ... this multi-agent reinforcement learning algorithm performs much better than many existing algorithms.","one_line_summary":"Team-symmetric games always have team-symmetric Nash equilibria solvable via linear complementarity problems, and the DelAC actor-critic MARL algorithm outperforms existing methods in simulations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that players within a team have perfectly symmetric identities and identical payoff functions holds in the target applications, and that simulation results generalize beyond the tested environments.","pith_extraction_headline":"Team-symmetric stochastic games always have a team-symmetric Nash equilibrium that a new actor-critic algorithm can locate efficiently."},"references":{"count":35,"sample":[{"doi":"","year":2024,"title":"S. V. Albrecht, F. Christianos, and L. Sch ¨afer,Multi-Agent Reinforcement Learning Foundations and Modern Approaches. Cambridge, Massachusetts: The MIT Press, 2024","work_id":"938b75ad-a62e-4d7b-9913-82903460cfa0","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2007,"title":"If multi-agent learning is the answer, what is the question?","work_id":"3edec534-8da1-4f61-b699-2365de22f47f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"Nash Q-learning for general-sum stochastic games,","work_id":"00f596d0-9d08-4f30-8750-df4841e06a4d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"The complexity of computing a Nash equilibrium,","work_id":"cbc8089f-d08d-4046-8647-9ecd91285e11","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Settling the complexity of two-player Nash equilibrium,","work_id":"f3fa2a8f-9f41-43ba-a45c-c9769efc1210","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"9cf9b0dc5e398e23238c8b1cd5de5786baace12377a2dd690aa374f6a6a1b01a","internal_anchors":3},"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"},"verdict_id":"dc81200c-9ceb-4bb6-afae-c83033e6f981"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwQvBFHO6ZbKQQX396st8dJ6yE/sShTr6+ioGETqR8C21vWEmzVd9W4wYJAx5Y0fSCEPzWAn6+TVVKEsLQEJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:44:10.551930Z"},"content_sha256":"582cae1d7420ba497c25d5d4bc5581894bca2877ce15e4c003cf3b515efb0233","schema_version":"1.0","event_id":"sha256:582cae1d7420ba497c25d5d4bc5581894bca2877ce15e4c003cf3b515efb0233"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/bundle.json","state_url":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T10:44:10Z","links":{"resolver":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2","bundle":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/bundle.json","state":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YI6ODTLDHTCQ2NWXXRNRXKPDI2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"02c6b6054327cdbfc335de78e18242affb2f67baa6fed6c151a1b154a8a1c57b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-11T12:00:27Z","title_canon_sha256":"c4586bc3129a7d398f8d3cc4794cd96fd5395be9c969d76d4e91a4e4aafabf41"},"schema_version":"1.0","source":{"id":"2605.12555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12555","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12555v1","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12555","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"YI6ODTLDHTCQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YI6ODTLDHTCQ2NWX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YI6ODTLD","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:582cae1d7420ba497c25d5d4bc5581894bca2877ce15e4c003cf3b515efb0233","target":"graph","created_at":"2026-05-18T03:10:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that team-symmetric games always have a team-symmetric Nash equilibrium. We develop and solve a linear complementarity problem of team-symmetric Nash equilibria. ... this multi-agent reinforcement learning algorithm performs much better than many existing algorithms."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that players within a team have perfectly symmetric identities and identical payoff functions holds in the target applications, and that simulation results generalize beyond the tested environments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Team-symmetric games always have team-symmetric Nash equilibria solvable via linear complementarity problems, and the DelAC actor-critic MARL algorithm outperforms existing methods in simulations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Team-symmetric stochastic games always have a team-symmetric Nash equilibrium that a new actor-critic algorithm can locate efficiently."}],"snapshot_sha256":"b5e3331057af1c7ef5f956f3b5a84f3d1e9ed21ceda2e4707bdb593055deb739"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we study team-symmetric games with $m\\ge 2$ teams. Players within a team have symmetric identity and have a common payoff function. We show that team-symmetric games always have a team-symmetric Nash equilibrium. We develop and solve a linear complementarity problem of team-symmetric Nash equilibria. We propose an actor-critic based multi-agent reinforcement learning algorithm for team-symmetric games. Through simulations, we show that this multi-agent reinforcement learning algorithm performs much better than many existing algorithms.","authors_text":"Duan-Shin Lee, Yu-Hsiu Hung","cross_cats":["cs.GT"],"headline":"Team-symmetric stochastic games always have a team-symmetric Nash equilibrium that a new actor-critic algorithm can locate efficiently.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-11T12:00:27Z","title":"DelAC: A Multi-agent Reinforcement Learning of Team-Symmetric Stochastic Games"},"references":{"count":35,"internal_anchors":3,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"S. V. Albrecht, F. Christianos, and L. Sch ¨afer,Multi-Agent Reinforcement Learning Foundations and Modern Approaches. Cambridge, Massachusetts: The MIT Press, 2024","work_id":"938b75ad-a62e-4d7b-9913-82903460cfa0","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"If multi-agent learning is the answer, what is the question?","work_id":"3edec534-8da1-4f61-b699-2365de22f47f","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Nash Q-learning for general-sum stochastic games,","work_id":"00f596d0-9d08-4f30-8750-df4841e06a4d","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The complexity of computing a Nash equilibrium,","work_id":"cbc8089f-d08d-4046-8647-9ecd91285e11","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Settling the complexity of two-player Nash equilibrium,","work_id":"f3fa2a8f-9f41-43ba-a45c-c9769efc1210","year":2006}],"snapshot_sha256":"9cf9b0dc5e398e23238c8b1cd5de5786baace12377a2dd690aa374f6a6a1b01a"},"source":{"id":"2605.12555","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T21:26:41.584151Z","id":"dc81200c-9ceb-4bb6-afae-c83033e6f981","model_set":{"reader":"grok-4.3"},"one_line_summary":"Team-symmetric games always have team-symmetric Nash equilibria solvable via linear complementarity problems, and the DelAC actor-critic MARL algorithm outperforms existing methods in simulations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Team-symmetric stochastic games always have a team-symmetric Nash equilibrium that a new actor-critic algorithm can locate efficiently.","strongest_claim":"We show that team-symmetric games always have a team-symmetric Nash equilibrium. We develop and solve a linear complementarity problem of team-symmetric Nash equilibria. ... this multi-agent reinforcement learning algorithm performs much better than many existing algorithms.","weakest_assumption":"The assumption that players within a team have perfectly symmetric identities and identical payoff functions holds in the target applications, and that simulation results generalize beyond the tested environments."}},"verdict_id":"dc81200c-9ceb-4bb6-afae-c83033e6f981"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b50e39b928a36f6e9999c5d25b340150e8f140c6799868553483b684b4d05671","target":"record","created_at":"2026-05-18T03:10:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"02c6b6054327cdbfc335de78e18242affb2f67baa6fed6c151a1b154a8a1c57b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-11T12:00:27Z","title_canon_sha256":"c4586bc3129a7d398f8d3cc4794cd96fd5395be9c969d76d4e91a4e4aafabf41"},"schema_version":"1.0","source":{"id":"2605.12555","kind":"arxiv","version":1}},"canonical_sha256":"c23ce1cd633cc50d36d7bc5b1ba9e34696a3888045a5da3051dd49eb88143e08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c23ce1cd633cc50d36d7bc5b1ba9e34696a3888045a5da3051dd49eb88143e08","first_computed_at":"2026-05-18T03:10:02.069195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:02.069195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4LGXLzx5nSV9/KOS4jw0YyTPRy6tiYy5eBYJqE7NC22crXUvwMUrbsYN23d952H+vf7F2hSiyXpH5Sl5Ic2TCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:02.069807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b50e39b928a36f6e9999c5d25b340150e8f140c6799868553483b684b4d05671","sha256:582cae1d7420ba497c25d5d4bc5581894bca2877ce15e4c003cf3b515efb0233"],"state_sha256":"0839f22755971b3cae26ff1d1c20462eab0cdafe11dd6d2e97afb662765bd8db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCS0AQHemgmDV8dTxg/lIrw+y0cBfYm6fSSVx2ohPEc40qFQPCSEbArofUCjVPs9KtnfVPFI2fB92R0rhXI3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:44:10.557390Z","bundle_sha256":"d4ddd55e661c66a6964985a89f61961b0ad6f8ab6be9a8f0f4c421c94ea63d5b"}}