Name
Abstract | ||
|---|---|---|
The following search game is considered: there are two players, say Paul (or questioner) and Carole (or responder). Carole chooses a number x^*@?S"n={1,2,...,n}, Paul has to find the number x^* by asking q-ary bi-interval queries and Carole is allowed to lie at most once throughout the game. The minimum worst-case number L"B(n,q,1) of q-ary bi-interval queries necessary to guess the number x^* is determined exactly for all integers n=1 and q=2. It turns out that L"B(n,q,1) coincides with the minimum worst-case number L(n,q,1) of arbitrary q-ary queries. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ipl.2007.03.003 | Inf. Process. Lett. |
Keywords | Field | DocType |
q-ary search,following search game,minimum worst-case number,arbitrary q-ary query,integers n,q-ary bi-interval,q-ary bi-interval query,fault tolerance,fault tolerant | Integer,Discrete mathematics,Combinatorics,Search game,Mathematics | Journal |
Volume | Issue | ISSN |
103 | 2 | 0020-0190 |
Citations | PageRank | References |
1 | 0.36 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen An Liu | 1 | 65 | 12.61 |
| Kun Meng | 2 | 3 | 2.08 |
| Shu Min Xing | 3 | 1 | 0.69 |