arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.0064math.LOcs.LOmath.CO
收藏

关于将对策论的时间形式推广到S5模态框架的渐近组合学

On Generalizing a Temporal Formalism for Game Theory to the Asymptotic Combinatorics of S5 Modal Frames

Samuel Reid

摘要:

一个时间理论的形式主义理解对策论描述一组时间点上的严格的顺序关系$T$定义一个游戏$T$。使用这种形式主义,证明策梅罗定理,其中规定,每一个有限的2-玩家零和游戏是确定的,给出了一个详尽的分析尼姆的游戏。进一步,给出了任意时间点集上博弈的组合分析,特别证明了具有基数$n$的集合$T$上不同博弈的个数是$n$元素集合上偏序的个数.将这一定理从时间模态框架推广到S5模态框架,证明了S5模态框架$\mathcal{F} = \ < W, R \ >$与$|W|=n$的同构类数等于分拆函数$p(n)$ .作为分拆函数渐近于Hardy-Ramanujan数$$\frac{1}{4\sqrt{3}n}e^{π\sqrt{2n/3}}$$这一事实的推论,S5模态标架$\mathcal{F} = \ < W, R \ >$与$|W|=n$的同构类的数目渐近于Hardy-Ramanujan数。最后,我们利用这些结果证明了任意模态框架是概率为零的S5模态框架。

英文摘要:

A temporal-theoretic formalism for understanding game theory is described where a strict ordering relation on a set of time points $T$ defines a game on $T$. Using this formalism, a proof of Zermelo's Theorem, which states that every finite 2-player zero-sum game is determined, is given and an exhaustive analysis of the game of Nim is presented. Furthermore, a combinatorial analysis of games on a set of arbitrary time points is given; in particular, it is proved that the number of distinct games on a set $T$ with cardinality $n$ is the number of partial orders on a set of $n$ elements. By generalizing this theorem from temporal modal frames to S5 modal frames, it is proved that the number of isomorphism classes of S5 modal frames $\mathcal{F} = \ < W, R \ >$ with $|W|=n$ is equal to the partition function $p(n)$. As a corollary of the fact that the partition function is asymptotic to the Hardy-Ramanujan number $$\frac{1}{4\sqrt{3}n}e^{π\sqrt{2n/3}}$$ the number of isomorphism classes of S5 modal frames $\mathcal{F} = \ < W, R \ >$ with $|W|=n$ is asymptotically the Hardy-Ramanujan number. Lastly, we use these results to prove that an arbitrary modal frame is an S5 modal frame with probability zero.

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

↑