Der Open-access-publikationsserver Der Zbw – Leibniz-informationszentrum Wirtschaft the Open Access Publication Server of the Zbw – Leibniz Information Centre for Economics Dueling Algorithms Dueling Algorithms
Der Open-access-publikationsserver Der Zbw – Leibniz-informationszentrum Wirtschaft the Open Access Publication Server of the Zbw – Leibniz Information Centre for Economics Dueling Algorithms Dueling Algorithms
复制标题
DOI：
--
复制
发表时间：
--
期刊：
影响因子：
--
通讯作者：
中科院分区：
文献类型：
--
作者：
用途：ZBW赠款您（用户）非独家权利，根据→ www.example.com规定的条款，在产权期限内免费使用所选作品，不受地域限制http://www.econstor.eu/dspace/Nutzungsbedingungen首次使用所选作品时，用户同意并声明遵守这些使用条款。摘要从竞争的角度重新审视经典的算法搜索和优化问题。而不是一个单一的优化器最小化预期成本，我们认为一个零和游戏中的优化问题是两个球员，其唯一的目标是超越对手。这类游戏通常是指数级大的零和游戏，但它们通常具有丰富的组合结构。我们提供了一般的技术，通过这种结构可以利用找到最小最大最优和近似最小最大最优的策略。我们给出了排名，招聘，压缩和二进制搜索决斗等的例子。我们给出了如何经常可以击败经典的优化算法在这样的决斗的界限。
Terms of use: The ZBW grants you, the user, the non-exclusive right to use the selected work free of charge, territorially unrestricted and within the time limit of the term of the property rights according to the terms specified at → http://www.econstor.eu/dspace/Nutzungsbedingungen By the first use of the selected work the user agrees and declares to comply with these terms of use. Abstract We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose only goal is to outperform the opponent. Such games are typically exponentially large zero-sum games, but they often have a rich combinatorial structure. We provide general techniques by which such structure can be leveraged to find minmax-optimal and approximate minmax-optimal strategies. We give examples of ranking, hiring, compression, and binary search duels, among others. We give bounds on how often one can beat the classic optimization algorithms in such duels.