期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2013
卷号：4
期号：6
DOI：10.14569/IJACSA.2013.040636
出版社：Science and Information Society (SAI)
摘要：Probabilistic algorithms are designed to handle problems that do not admit deterministic effective solutions. In the case of the election problem, many algorithms are available and applicable under appropriate assumptions, for example: the uniform election in trees, k??trees and polyominoids. In this paper, first, we introduce a probabilistic algorithm for the uniform election in the triangular grid graphs, then, we expose the set of rules that generate the class of the triangular grid graphs. The main of this paper is devoted to the analysis of our algorithm. We show that our algorithm is totally fair in so far as it gives the same probability to any vertex of the given graph to be elected.
