TU博弈的多项式表示
Polynomial representation of TU-games
AI总结:
本文利用可数无限参与者集合、有限集合自然排序及形式多项式,提出TU博弈、模糊测度、容度与集合函数的多项式根表示,并引入不可约、乘法和分圆等新博弈族。
摘要:
本文提出了TU博弈、模糊测度、容度以及更一般的集合函数的一种多项式表示。我们的表示需要一个可数无限的参与者集合,以及递归定义的N的有限集合的自然排序。对于博弈向量空间的给定基,我们将每个博弈v对应到一个次数至多为2^n-1的形式多项式,其系数是v在给定基中的坐标。根据代数基本定理,v可以由该多项式的根表示。我们展示了由这一多项式语境产生的若干新博弈族,例如不可约博弈、乘法博弈和分圆博弈。
英文摘要:
We propose in this paper a polynomial representation of TU-games, fuzzy measures, capacities, and more generally set functions. Our representation needs a countably infinite set of players and the natural ordering of finite sets of $\mathbb{N}$, defined recursively. For a given basis of the vector space of games, we associate to each game $v$ a formal polynomial of degree at most $2^n-1$ whose coefficients are the coordinates of $v$ in the given basis. By the fundamental theorem of algebra, $v$ can be represented by the roots of the polynomial. We present some new families of games stemming from this polynomial context, like the irreducible games, the multiplicative games and the cyclotomic games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。