有限五智能体ABCW模型中单步预测的精确最小场划分
Exact Minimum Field Partition for One-Step Prediction in a Finite Five-Agent ABCW Model
浏览论文内容
中文总结 AI 辅助
本文针对有限五智能体ABCW模型，通过构造不相容图并结合着色与子图求解，得出仅保留当前动作时实现单步精确场预测的最小场类数为692的结论。
中文摘要 AI 辅助
为了精确预测指定未来，当前状态中必须保留哪些区分？我们针对确定性五智能体ABCW模型的有限可达集研究该问题，其中二元智能体动作与策略随带权有向影响场协同演化。数据集由四类初始场族及全部4096个动作-策略初始条件生成，包含56536个转移和2562个不同的当前场。我们保留当前动作，寻求最粗糙的仅基于场的划分，该划分能在每个观测转移上唯一确定完整的单步前瞻场。九类自然特征族及其全部511种非空组合可作为强近似预测器，但无法实现非平凡的精确场压缩。因此我们构造不相容图，其顶点为当前场，边连接在共享观测动作下产生不同下一个场的场。恰当的692着色给出构造性上界；独立锚定动作分解后，对50个非平凡诱导子图的精确求解给出匹配下界。因此，场类的最小数量恰好为692。该数量仅适用于指定的有限可达集、仅场压缩、保留的当前动作、单步目标及精确预测要求，并非ABCW系统的通用宏观态计数。
英文摘要
Which distinctions in a present state must be retained to predict a specified future exactly? We study this question on a finite reachable set of a deterministic five-agent ABCW model in which binary agent actions and strategies coevolve with a weighted directed influence field. The dataset is generated from four initial-field families and all 4,096 action-strategy initial conditions, yielding 56,536 transitions and 2,562 distinct current fields. We retain the current action and seek the coarsest field-only partition that uniquely determines the complete one-step-ahead field on every observed transition. Nine natural feature families and all 511 of their nonempty combinations provide strong approximate predictors but no exact nontrivial field compression. We therefore construct an incompatibility graph whose vertices are current fields and whose edges join fields that produce different next fields under a shared observed action. A proper 692-coloring gives a constructive upper bound. An independent anchor-action decomposition, followed by exact solution of the 50 nontrivial induced subgraphs, gives the matching lower bound. Hence the minimum number of field classes is exactly 692. This number applies only to the specified finite reachable set, field-only compression, retained current actions, one-step target, and exact-prediction requirement; it is not a universal macrostate count for ABCW systems.
