arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.5102math.DSmath.NT
收藏

K-Fibonacci序列与吝啬博弈的最小获胜限额

K-Fibonacci sequences and minimal winning quota in Parsimonious game

Flavio Pressacco, Giacomo Plazzotta, Laura Ziani

摘要:

简约博弈是常和齐次加权多数博弈的一个子集,由它们的自由型表示向量明确描述。证明了除一致对策外,吝啬对策的最小获胜配额满足一个二阶线性齐次变系数有限差分方程。我们提供了这样一个方程的解决方案,它可以被认为是一个适当的k-Fibonacci序列的多项式展开的广义版本。此外,我们表明,最小获胜配额是一个对称函数的表示向量;利用这一属性,它是直接证明,双吝啬游戏,即一对夫妇的游戏,其自由类型表示是彼此对称,共享相同的最小获胜配额。

英文摘要:

Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order, linear, homogeneous, finite difference equation with nonconstant coefficients except for uniform games. We provide the solution of such an equation which may be thought as the generalized version of the polynomial expansion of a proper k-Fibonacci sequence. In addition we show that the minimal winning quota is a symmetric function of the representation vector; exploiting this property it is straightforward to prove that twin Parsimonious games, i.e. a couple of games whose free type representations are each other symmetric, share the same minimal winning quota.

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

↑