彩色线性规划、纳什均衡和枢轴
Colorful linear programming, Nash equilibrium, and pivots
摘要:
由Bárány在1982年证明的彩色Carathéodory定理指出,给定d+1个点集S_1,...,S_{d+1},每个S_i的凸包中包含0,则存在S_i的并的子集T,该子集T的凸包中包含0,并且使得T最多包含来自每个S_i的一个点。一个有趣的问题--仍然是开放的--是这样一个集合T,它的存在性是确定的,是否可以在多项式时间内找到。1997年,Bárány和Onn将彩色线性规划定义为与彩色Carathéodory定理相关的算法问题。我们刚才提到的问题属于彩色线性规划。彩色线性规划的传统应用在于离散几何。在本文中,我们研究它与其他领域,如博弈论,运筹学,组合数学的关系。关于博弈论,我们证明了计算双矩阵博弈中的纳什均衡是一个复杂的线性规划问题。我们还制定了彩色线性规划的优化问题,并表明,作为一般的线性规划,决策和优化是计算等价的。然后我们讨论一个丰富多彩的版本丹齐格的饮食问题。我们还提出了一个变种的Bárány算法,这是一个算法计算一个集T的存在性是由丰富多彩的Carathéodory定理。我们的算法使一个明确的连接与单纯形算法,我们讨论了它的计算效率。还提供了相关的复杂性和组合的结果。
英文摘要:
The colorful Carathéodory theorem, proved by Bárány in 1982, states that given d+1 sets of points S_1,...,S_{d+1} in R^d, with each S_i containing 0 in its convex hull, there exists a subset T of the union of the S_i's containing 0 in its convex hull and such that T contains at most one point from each S_i. An intriguing question -- still open -- is whether such a set T, whose existence is ensured, can be found in polynomial time. In 1997, Bárány and Onn defined colorful linear programming as algorithmic questions related to the colorful Carathéodory theorem. The question we just mentioned comes under colorful linear programming. The traditional applications of colorful linear programming lie in discrete geometry. In this paper, we study its relations with other areas, such as game theory, operations research, and combinatorics. Regarding game theory, we prove that computing a Nash equilibrium in a bimatrix game is a colorful linear programming problem. We also formulate an optimization problem for colorful linear programming and show that as for usual linear programming, deciding and optimizing are computationally equivalent. We discuss then a colorful version of Dantzig's diet problem. We also propose a variant of the Bárány algorithm, which is an algorithm computing a set T whose existence is ensured by the colorful Carathéodory theorem. Our algorithm makes a clear connection with the simplex algorithm and we discuss its computational efficiency. Related complexity and combinatorial results are also provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。