{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YI6ODTLDHTCQ2NWXXRNRXKPDI2","short_pith_number":"pith:YI6ODTLD","schema_version":"1.0","canonical_sha256":"c23ce1cd633cc50d36d7bc5b1ba9e34696a3888045a5da3051dd49eb88143e08","source":{"kind":"arxiv","id":"2605.12555","version":1},"attestation_state":"computed","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."},"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":true,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.12555","created_at":"2026-05-18T03:10:02.069278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12555v1","created_at":"2026-05-18T03:10:02.069278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12555","created_at":"2026-05-18T03:10:02.069278+00:00"},{"alias_kind":"pith_short_12","alias_value":"YI6ODTLDHTCQ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"YI6ODTLDHTCQ2NWX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"YI6ODTLD","created_at":"2026-05-18T12:33:37.589309+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/YI6ODTLDHTCQ2NWXXRNRXKPDI2","json":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2.json","graph_json":"https://pith.science/api/pith-number/YI6ODTLDHTCQ2NWXXRNRXKPDI2/graph.json","events_json":"https://pith.science/api/pith-number/YI6ODTLDHTCQ2NWXXRNRXKPDI2/events.json","paper":"https://pith.science/paper/YI6ODTLD"},"agent_actions":{"view_html":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2","download_json":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2.json","view_paper":"https://pith.science/paper/YI6ODTLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12555&json=true","fetch_graph":"https://pith.science/api/pith-number/YI6ODTLDHTCQ2NWXXRNRXKPDI2/graph.json","fetch_events":"https://pith.science/api/pith-number/YI6ODTLDHTCQ2NWXXRNRXKPDI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/action/storage_attestation","attest_author":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/action/author_attestation","sign_citation":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/action/citation_signature","submit_replication":"https://pith.science/pith/YI6ODTLDHTCQ2NWXXRNRXKPDI2/action/replication_record"}},"created_at":"2026-05-18T03:10:02.069278+00:00","updated_at":"2026-05-18T03:10:02.069278+00:00"}