Oct 28, 2008 · We consider a game played by two players, Paul and Carol. At the beginning of the game, Carol fixes a coloring of n balls.

Carol truthfully answers his question. Paul's goal is to determine the most frequent (plurality) color in the coloring by asking as few questions as possible.

Paul's goal is to determine the most frequent (plurality) color in the coloring by asking as few questions as possible. The game is studied in the probabilistic ...

Randomized strategies for the plurality problem. Král', D.; Sgall, J.; Tichý, T. Discrete Applied Mathematics 156(17): 3305-3311. ISSN: 0166-218X. 2008. DOI ...

Saks, Probabilistic strategies for the partition and plurality problems, Random Struct. ... Tichý, Randomized strategies for the plurality problem, Discrete Appl.

Randomized strategies for the plurality problem ... We consider a game played by two players, Paul and Carol. At the beginning of the game, Carol fixes a coloring ...

Jul 1, 2008 · Randomized strategies for the plurality problem. Daniel Král'a, Jiří ... Fix a deterministic strategy for the Plurality problem. Since a ...

Dec 1, 2006 · Random Structures & Algorithms journal publishes research on discrete random structures and their applications in graph theory, ...

Abstract. The plurality problem is a game between two participants: Paul and Carole. We are given n balls, each of them is colored with one out of c colors.

Apr 28, 2016 · Oblivious and adaptive strategies for the majority and plurality problems. ... Randomized strategies for the plurality problem. Discrete Applied.