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

寻找具有均匀物品价值的筷子拍卖中最优策略的高效方法

Efficient Method for Finding Optimal Strategies in Chopstick Auctions with Uniform Objects Values

Stanisław Kaźmierowski, Marcin Dziubiński

AI总结:

提出一种结合对称化、冲突矩阵与double oracle算法的高效方法,用于计算均匀价值多战场冲突中的纳什均衡,显著提升了计算速度。

摘要:

我们提出了一种算法,用于计算一类具有多个战场、战场价值均匀且具有非线性聚合函数的冲突中的纳什均衡(NE)。通过将Hart [9]为Colonel Blotto游戏提出的对称化思想扩展到更广泛的对称多战场冲突类别中,我们以指数因子减少了玩家的策略数量。我们提出了一种冲突矩阵算法,允许在多项式时间内计算对称化模型中的收益。将对称化和冲突矩阵算法与double oracle算法相结合,我们获得了一种计算所讨论模型中NE的算法,与基于标准线性规划(LP)的方法相比,实现了显著的加速。我们还引入了一种启发式方法以进一步加速该过程。总体而言,我们的方法为计算特定冲突类别中的NE提供了一种高效且新颖的方法,并在各个领域具有潜在的实际应用。

英文摘要:

We propose an algorithm for computing Nash equilibria (NE) in a class of conflicts with multiple battlefields with uniform battlefield values and a non-linear aggregation function. By expanding the symmetrization idea of Hart [9], proposed for the Colonel Blotto game, to the wider class of symmetric conflicts with multiple battlefields, we reduce the number of strategies of the players by an exponential factor. We propose a clash matrix algorithm which allows for computing the payoffs in the symmetrized model in polynomial time. Combining symmetrization and clash matrix algorithm with the double oracle algorithm we obtain an algorithm for computing NE in the models in question that achieves a significant speed-up as compared to the standard, LP-based, approach. We also introduce a heuristic to further speed up the process. Overall, our approach offers an efficient and novel method for computing NE in a specific class of conflicts, with potential practical applications in various fields.

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

↑