arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.10417math.OCcs.SYeess.SYq-fin.MF
收藏

非线性控制对鲁棒对数增长的益处:以抛硬币博弈为演示案例

On the Benefit of Nonlinear Control for Robust Logarithmic Growth: Coin Flipping Games as a Demonstration Case

Anton V. Proskurnikov, B. Ross Barmish

AI总结:

本文针对有偏硬币重复抛掷博弈,提出鲁棒非线性控制方法以最大化财富的期望对数增长,给出最优控制器的闭式解,并证明其鲁棒优于线性控制器,同时将参数复杂度从指数级降至 O(n^2)。

摘要:

本文的出发点是大量涉及递归投注博弈的文献,这些文献以财富的期望对数增长作为性能准则。尽管几乎所有现有论文都涉及线性反馈的使用,但非线性控制的使用却明显缺失。这一点在处理凯利投注(Kelly Betting)的大量文献子集中体现得最为典型。以此作为高层次动机,我们研究了在该框架中使用非线性控制的潜力。为此,我们考虑一个“演示案例”,这是该研究方向中遇到的最简单场景之一:重复抛掷一枚有偏硬币,正面概率为 p,每次抛掷的赔率为等额赔付。首先,我们构建了一个新的鲁棒非线性控制问题,我们认为该问题既易于理解,又适合处理关于分布鲁棒性的关切;也就是说,我们不是像经典凯利公式那样假设 p 完全已知,而是从该概率的一个有界集合 P ⊆ [0,1] 出发。然后,我们给出一个定理——本文的主要结果——该定理给出了最优鲁棒非线性控制器的闭式描述,并给出一个推论,证明该控制器鲁棒地优于文献中出现的线性控制器。本文的第二个贡献相对次要,涉及我们解的可计算性。对于一个 n 次抛掷的博弈,尽管一个容许控制器有 2^n−1 个参数,但在最优情况下,其中只有 O(n^2) 个参数是不同的。最后,本文指出,关于收益的初始假设以及在 p 上使用均匀分布,仅仅是为了表述简洁以及符合 Letter 类论文的长度要求。因此,本文还包含一个新章节,讨论如何放宽这些假设。

英文摘要:

The takeoff point for this paper is the voluminous body of literature addressing recursive betting games with expected logarithmic growth of wealth being the performance criterion. Whereas almost all existing papers involve use of linear feedback, the use of nonlinear control is conspicuously absent. This is epitomized by the large subset of this literature dealing with Kelly Betting. With this as the high-level motivation, we study the potential for use of nonlinear control in this framework. To this end, we consider a ``demonstration case'' which is one of the simplest scenarios encountered in this line of research: repeated flips of a biased coin with probability of heads~$p$, and even-money payoff on each flip. First, we formulate a new robust nonlinear control problem which we believe is both simple to understand and apropos for dealing with concerns about distributional robustness; i.e., instead of assuming that~$p$ is perfectly known as in the case of the classical Kelly formulation, we begin with a bounding set ~${\cal P} \subseteq [0,1]$ for this probability. Then, we provide a theorem, our main result, which gives a closed-form description of the optimal robust nonlinear controller and a corollary which establishes that it robustly outperforms linear controllers such as those found in the literature. A second, less significant, contribution of this paper bears upon the computability of our solution. For an $n$-flip game, whereas an admissible controller has~$2^n-1$ parameters, at the optimum only~$O(n^2)$ of them turn out to be distinct. Finally, it is noted that the initial assumptions on payoffs and the use of the uniform distribution on~$p$ are made solely for simplicity of the exposition and compliance with length requirements for a Letter. Accordingly, the paper also includes a new section with a discussion indicating how these assumptions can be relaxed.

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

↑