Affiliation:
1. INRIA-Lorraine, Vandoeuvre-lès-Nancy, France
2. Illinois Institute of Technology, Chicago, IL
Abstract
Given a set of
n
elements, each of which is colored one of
c
≥ 2 colors, we have to determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We derive lower bounds for the expected number of color comparisons when the
c
n
colorings are equally probable. We prove a general lower bound of
c
/3
n
−
O
(√
n
) for
c
≥ 2; we prove the stronger particular bounds of 7/6
n
−
O
(√
n
) for
c
= 3, 54/35
n
−
O
(√
n
) for
c
= 4, 607/315
n
−
O
(√
n
) for
c
= 5, 1592/693
n
−
O
(√
n
) for
c
= 6, 7985/3003
n
−
O
(√
n
) for
c
= 7, and 19402/6435
n
−
O
(√
n
) for
c
= 8.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference4 articles.
1. Alonso L. and Reingold E. M. 2006. Average-case analysis of some plurality algorithms. Submitted for publication. Alonso L. and Reingold E. M. 2006. Average-case analysis of some plurality algorithms. Submitted for publication.
2. Determining plurality
3. Determining the majority
4. The Average-Case Complexity of Determining the Majority
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Anti-CD6 mAbs for the treatment of psoriasis;Expert Opinion on Biological Therapy;2020-06-09
2. Average-case analysis of some plurality algorithms;ACM Transactions on Algorithms;2009-03
3. Determining plurality;ACM Transactions on Algorithms;2008-06