论文标题
负载分享依赖模型和任何任意排名方案的投票情况的构建
Load-sharing dependence models and construction of voting situations for any arbitrary ranking schemes
论文作者
论文摘要
在本文中，我们介绍了一项关于随机变量，投票理论的上下文以及与此类主题相关的悖论的研究。在可靠性理论领域，术语负载共享模型通常用于指定一种特殊类型的多元生存模型。我们证明了这种依赖模型在其他一些领域（例如这里感兴趣的领域）也可以具有的有效性。几个重要的论文已经致力于挑出并证明在投票理论领域的一般结论。我们通过制定一种证明方法，替代现有的方法以及本质上完全概率来重新重新制定和实现此类结论。作为该方法的主要特征，我们将注意力集中在与非负随机变量的M-Tuplass相关的排名方案上，并适当地挑出了负载共享模型的特殊子类。然后，我们表明，只有考虑这种特殊的生存模型家族，就可以方便地获得所有可能的排名方案。这一结果导致了一些关于投票情况的建设的新见解，这些见解引起了所有可能的投票悖论。我们的方法和相关含义也将通过一些示例和内容丰富的评论来说明。
In this paper we present a study about minima among random variables, about the context of voting theory, and about paradoxes related with such topics. In the field of reliability theory, the term load-sharing model is commonly used to designate a special type of multivariate survival models. We demonstrate the effectiveness that such dependence models can have also in some other fields, such as those of interest here. Several important, and by now classic, papers have been devoted to single out and to prove general conclusions in the field of voting theory. We reformulate and achieve such conclusions by developing a method of proof, alternative to the existing ones, and completely probabilistic in nature. As main features of this method, we focus attention on ranking schemes associated to m-tuples of non-negative random variables and suitably single out a special subclass of load-sharing models. Then we show that all possible ranking schemes can be conveniently obtained by only considering such a special family of survival models. This result leads to some new insight about the construction of voting situations which give rise to all possible types of voting paradoxes. Our method and related implications will be also illustrated by means of some examples and informative remarks.
