A plurality problem with three colors and query size three

Gerbner, Dániel; Dániel, Lenger,; Vizer, Máté

doi:10.48550/arxiv.1708.05864

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we deal with generalizations of the pairing model, when we ask queries of larger size. The first model of this kind was introduced and investigated by De Marco, Kranakis and Wiener [6], then many related results appeared in the literature [2,3,5,7,10,11]. However, most of them studied only the adaptive case.…”

Section: Modelsmentioning

confidence: 99%

Majority problems of large query size

Gerbner

Vizer

2019

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-called General Model the answer to a query shows if all the balls in the set are of the same color or not. In the so-called Counting Model the answer to a query gives the difference between the cardinalities of the color classes in the query.Our goal is to show a ball of the larger color class, or prove that the color classes are of the same size, using as few queries as possible. In this paper we improve the bounds given by De Marco and Kranakis [7] for the number of queries needed. arXiv:1610.09114v2 [math.CO] 30 Aug 2018 (or showing that there is no such ball) the Majority Problem. We would like to determine the minimum number of queries needed in the worst case, when our adversary -we will call him Adversary in the following -, who tells us the answers for the queries wants to postpone the solution of the Majority Problem.A model of the Majority Problem is given by the number of balls [n], the number of colors, the size of the queries (that we will denote by k), and the possible answers of Adversary. Sometimes we will use the hypergraph language, so we will speak about the hypergraph of the queries (i.e. the hypergraph, where the vertices are the balls and the edges are the asked queries up to a certain round.).The first Majority Problem model, the so-called pairing model -when the query size is two, and the answer of Adversary is yes if the two balls have the same color and no otherwise -was investigated by Fisher and Salzberg [12], who proved that if we do not have any restriction on the number of colors, 3n/2 − 2 queries are necessary and sufficient to solve the Majority Problem. If the number of colors is two, then Saks and Werman [19] proved that the minimum number of queries needed is n−b(n), where b(n) is the number of 1's in the diadic form of n (we note that there are simpler proofs of this result, see [1,20]).In this paper we deal with two possible generalizations of the pairing model, the Counting and the General model. Both of them deals with queries of size greater than two.The first model that generalized the pairing model to larger queries was introduced and investigated by De Marco, Kranakis and Wiener [8], then many results appeared in the literature [4,7,11,15]. We note that for k ≥ 3 it is possible that in some model one can not solve the Majority Problem for small n or even for any n (see such a model in [15]). We also note that there are other possibilities to generalize the pairing model of the Majority Problem, e.g. the Plurality Problem [1,2,6,14,16], some random scenarios [9, 10, 13], or investigate the case when Adversary can lie [1,5], etc.Structure of the paper The rest of the paper is organized as follows: in the next section first we define the models and state the known results, then we state our new results. In Section 3 and Section 4 we prove our theorems, and in Section 5 we finish the article with some...

show abstract

Section: Modelsmentioning

confidence: 99%

Majority problems of large query size

Gerbner

Vizer

2019

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…They each define different variants of the majority problem. See [3,4,5,8,9,10] for results in case of large queries.…”

Section: Introductionmentioning

confidence: 99%

Finding non-minority balls with majority and plurality queries

Chang

Gerbner

Patkós

2020

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

Given a set of n colored balls, a majority, non-minority or plurality ball is one whose color class has size more than n/2, at least n/2 or larger than any other color class, respectively. We describe linear time algorithms for finding non-minority balls using query sets of size q of the following form: the answer to a majority/plurality query Q is a majority/plurality ball in Q or the statement that there is no such ball in Q.

show abstract

“…If the number of colors is two, then Saks and Werman [15] proved that the minimum number of queries needed in an adaptive search is n − b(n), where b(n) is the number of 1's in the binary form of n (we note that there are simpler proofs of this result, see [1,13,16]). There are several other generalizations of the problem, which include more colors [2,4,9,11], larger queries [3,4,6,7,10,11,12], non-adaptive [1,5,9], weighted versions [9].…”

Section: Introductionmentioning

confidence: 99%

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Damásdi¹,

Gerbner²,

Katona³

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study the problem of finding a majority vertex (or show that none exists), if we can query edges to learn whether their endpoints have the same or different colors. Denote the least number of queries needed in the worst case by m(G). It was shown by Saks and Werman that m(K n ) = n − b(n), where b(n) is the number of 1's in the binary representation of n.In this paper we initiate the study of the problem for general graphs. The obvious bounds for a connected graph G on n vertices are n − b(n) ≤ m(G) ≤ n − 1. We show that for any tree T on an even number of vertices we have m(T ) = n − 1, and that for any tree T on an odd number of vertices, we have n − 65 ≤ m(T ) ≤ n − 2. Our proof uses results about the weighted version of the problem for K n , which may be of independent interest. We also exhibit a sequence G n of graphs with m(G n ) = n − b(n) such that G n has O(nb(n)) edges and n vertices.

show abstract

A plurality problem with three colors and query size three

Cited by 3 publications

References 15 publications

Majority problems of large query size

Majority problems of large query size

Finding non-minority balls with majority and plurality queries

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

Contact Info

Product

Resources

About