Title of article
The halflie problem
Author/Authors
Spencer، نويسنده , , Joel and Yan، نويسنده , , Catherine H.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
21
From page
69
To page
89
Abstract
In Ulamʹs game Paul tries to find one of n possibilities with q Yes–No questions, while responder Carole is allowed to lie a fixed number k of times. We consider an asymmetric variant in which Carole must say yes when that is the correct answer (whence the halflie). We show that the maximal Ak(q) for which Paul wins has the asymptotic formAk(q)=2q+kk!q−k+Θ(2qq−k−12).
Keywords
Asymptotic formula , Ulamיs problem , Liarיs game , Asymmetric packing
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series A
Record number
1530812
Link To Document