Finding a majority ball with majority answers

From MaRDI portal
Publication:322261

DOI10.1016/J.ENDM.2015.06.047zbMATH Open1386.68113arXiv1509.08276OpenAlexW2130922498MaRDI QIDQ322261FDOQ322261

Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

Publication date: 14 October 2016

Abstract: Suppose we are given a set of n balls b1,ldots,bn each colored either red or blue in some way unknown to us. To find out some information about the colors, we can query any triple of balls bi1,bi2,bi3. As an answer to such a query we obtain (the index of) a {em majority ball}, that is, a ball whose color is the same as the color of another ball from the triple. Our goal is to find a {em non-minority ball}, that is, a ball whose color occurs at least fracn2 times among the n balls. We show that the minimum number of queries needed to solve this problem is Theta(n) in the adaptive case and Theta(n3) in the non-adaptive case. We also consider some related problems.


Full work available at URL: https://arxiv.org/abs/1509.08276




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Finding a majority ball with majority answers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322261)