Title of article
Randomized strategies for the plurality problem Original Research Article
Author/Authors
Daniel Kr?l’، نويسنده , , Ji?? Sgall، نويسنده , , Tom?? Tich?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
3305
To page
3311
Abstract
We consider a game played by two players, Paul and Carol. At the beginning of the game, Carol fixes a coloring of image balls. At each turn, Paul chooses a pair of the balls and asks Carol whether the balls have the same color. 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. The game is studied in the probabilistic setting when Paul is allowed to choose his next question randomly.
Keywords
Concrete complexity , Majority game , Plurality game , Randomized algorithms
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886913
Link To Document