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

带有乘积约束的极小极大优化的复杂性

The Complexity of Min-Max Optimization with Product Constraints

Bocconi University(博科尼大学);Politecnico di Milano(米兰理工大学)

Martino Bernasconi, Matteo Castiglioni

AI总结:

本文研究了在乘积约束下,非凸-非凹效用函数游戏的极小极大均衡计算问题,证明其属于PPAD难问题。

摘要:

我们研究了计算具有非凸-非凹效用函数f的游戏的局部极小极大均衡的计算复杂性。从Daskalakis、Skoulakis和Zampetakis[DSZ21]的工作可知,这个问题在限制情况下被认为是困难的,留下的问题是其在更自然的约束下的复杂性。在本文中,我们解决了这个问题,证明了即使在乘积约束下,该问题也是PPAD难的,特别是针对超立方体。

英文摘要:

We study the computational complexity of the problem of computing local min-max equilibria of games with a nonconvex-nonconcave utility function $f$. From the work of Daskalakis, Skoulakis, and Zampetakis [DSZ21], this problem was known to be hard in the restrictive case in which players are required to play strategies that are jointly constrained, leaving open the question of its complexity under more natural constraints. In this paper, we settle the question and show that the problem is PPAD-hard even under product constraints and, in particular, over the hypercube.

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

↑