arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.10236math.OCcs.DMcs.GT
收藏

一个多拟阵极大化问题的对策论方法

A Game Theoretic Approach to a Problem in Polymatroid Maximization

Lisa Hellerstein, Thomas Lidbetter

摘要:

我们考虑的问题,最大化的最小(加权)值的所有分量的向量在一个多拟阵。这是Fujishige提出并解决的字典序最优基问题的一个特例。我们给出了另一种制定的问题之间的零和对策的最大化的球员的混合策略集是基地的多拟阵和最小化的球员的混合策略集是一个单纯形。我们表明,这个游戏和它的三个变化统一在搜索,顺序测试和排队的几个问题。我们给出了一个新的,简短的推导最优策略的球员和表达式的游戏的价值。此外,我们给出了一组最小化的球员的最优策略的表征,我们认为特殊情况下,最优策略可以找到特别容易。

英文摘要:

We consider the problem of maximizing the minimum (weighted) value of all components of a vector over a polymatroid. This is a special case of the lexicographically optimal base problem introduced and solved by Fujishige. We give an alternative formulation of the problem as a zero-sum game between a maximizing player whose mixed strategy set is the base of the polymatroid and a minimizing player whose mixed strategy set is a simplex. We show that this game and three variations of it unify several problems in search, sequential testing and queuing. We give a new, short derivation of optimal strategies for both players and an expression for the value of the game. Furthermore, we give a characterization of the set of optimal strategies for the minimizing player and we consider special cases for which optimal strategies can be found particularly easily.

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

↑