视频游戏设计中策略多样性的优化
Optimizing for Strategy Diversity in the Design of Video Games
AI总结:
本文将视频游戏策略多样性问题建模为线性规划设计问题,通过选择约束矩阵和成本向量最大化唯一最优解支撑集数量,并基于循环多胞体给出上界及渐近最优构造。
摘要:
我们考虑设计一个线性规划的问题,使其在右侧值变化时具有多样化的解。该问题出现在视频游戏场景中,设计者希望玩家在游戏进程中采用不同的“武器”或“战术”。我们将这一设计问题建模为对约束矩阵 $A$ 和成本向量 $c$ 的选择,以最大化线性规划 $\max\{c^\top x \mid Ax \le b, x \ge 0\}$ 在所有资源向量 $b$ 上、且数据非负的情况下,唯一最优解的可能支撑集(我们称之为“loadouts”)的数量。我们给出了最优 loadouts 数量的上界,并提供了一类具有渐近最优 loadouts 数量的构造。该上界基于我们的问题与多面体组合学中点集三角剖分研究之间的联系,特别是循环多胞体的组合学。我们的渐近最优构造也借鉴了循环多胞体的性质。
英文摘要:
We consider the problem of designing a linear program that has diverse solutions as the right-hand side varies. This problem arises in video game settings where designers aim to have players use different "weapons" or "tactics" as they progress. We model this design question as a choice over the constraint matrix $A$ and cost vector $c$ to maximize the number of possible \emph{supports} of unique optimal solutions (what we call "loadouts") of Linear Programs $\max\{c^\top x \mid Ax \le b, x \ge 0\}$ with nonnegative data considered over all resource vectors $b$. We provide an upper bound on the optimal number of loadouts and provide a family of constructions that have an asymptotically optimal number of loadouts. The upper bound is based on a connection between our problem and the study of triangulations of point sets arising from polyhedral combinatorics, and specifically the combinatorics of the cyclic polytope. Our asymptotically optimal construction also draws inspiration from the properties of the cyclic polytope.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。