Informace o publikaci
Probabilistic strategies for the partition and plurality problems
| Autoři | |
|---|---|
| Rok publikování | 2007 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | RANDOM STRUCTURES & ALGORITHMS |
| Citace | |
| Doi | http://dx.doi.org/10.1002/rsa.20148 |
| Popis | We consider a game played by two players, Paul and Carol. Carol fixes a coloring of it balls with three colors. At each step, Paul chooses a pair of balls and asks Carol whether the balls have the same color. Carol truthfully answers yes or no. In the Plurality problem, Paul wants to find a ball with the most common color. In the Partition problem, Paul wants to partition the balls according to their colors. Paul's goal is to ask Carol the fewest number of questions to reach his goal. We find optimal probabilistic strategies for the Partition problem and the Plurality problem in the considered setting. (c) 2006 Wiley Periodicals, Inc. |