arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.04663cs.GT
收藏

用微分反向归纳法求解结构化递阶对策

Solving Structured Hierarchical Games Using Differential Backward Induction

Zun Li, Feiran Jia, Aditya Mate, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Yevgeniy Vorobeychik

摘要:

从大规模组织到分散的政治系统,层级战略决策是司空见惯的。我们介绍了一类新的结构层次游戏(SHGs),正式捕捉这种层次的战略互动。在SHG中,每个参与者都是树中的一个节点,参与者的策略选择是从根到叶子顺序排列的,首先是根,其次是它的孩子,然后是他们的孩子,等等,直到叶子。一个玩家在SHG中的效用取决于他自己的决定,以及他的父母和所有树叶的选择。因此,SHG推广了错误移动游戏,以及有许多追随者的Stackelberg游戏。我们利用两个序列的球员的动作,以及支付依赖的结构,开发一个基于梯度的反向传播风格的算法,我们称之为差分反向归纳(DBI),近似平衡的SHG。我们提供了一个充分条件的DBI收敛,并证明其有效性,在寻找近似平衡解的几个SHG模型的分层决策问题。

英文摘要:

From large-scale organizations to decentralized political systems, hierarchical strategic decision making is commonplace. We introduce a novel class of structured hierarchical games (SHGs) that formally capture such hierarchical strategic interactions. In an SHG, each player is a node in a tree, and strategic choices of players are sequenced from root to leaves, with root moving first, followed by its children, then followed by their children, and so on until the leaves. A player's utility in an SHG depends on its own decision, and on the choices of its parent and all the tree leaves. SHGs thus generalize simultaneous-move games, as well as Stackelberg games with many followers. We leverage the structure of both the sequence of player moves as well as payoff dependence to develop a gradient-based back propagation-style algorithm, which we call Differential Backward Induction (DBI), for approximating equilibria of SHGs. We provide a sufficient condition for convergence of DBI and demonstrate its efficacy in finding approximate equilibrium solutions to several SHG models of hierarchical policy-making problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑