Searching with lies under error cost constraints

Ahlswede R, Cicalese F, Deppe C (2008)
Discrete Applied Mathematics 156(9): 1444-1460.

Journal Article | Published | English

No fulltext has been uploaded

Author
; ;
Abstract
The Wnyi-Berlekamp-Ulam game is a classical model for the problem of determining the minimum number of queries to find an unknown member in a finite set when up to a finite number of the answers may be erroneous. In the variant considered in this paper, questions with q many possible answers are allowed, further lies are constrained by a bipartite graph with edges weighted by 0, 1, 2.... (the "channel"). The channel Gamma is an arbitrary assignment stipulating the cost of the different possible lies, i.e., of each answer j not equal i when the correct answer is i by Gamma(i, j). It is also assumed that a maximum cost a (sum of the cost of all wrong answers) can be afforded by the responder during the whole game. We provide tight asymptotic bounds for the number of questions needed to solve this problem. The appropriate searching strategies are actually provided. We also show that adaptiveness can be dramatically reduced when the channel satisfies certain symmetry constraints. (C) 2007 Elsevier B.V. All rights reserved.
Publishing Year
ISSN
PUB-ID

Cite this

Ahlswede R, Cicalese F, Deppe C. Searching with lies under error cost constraints. Discrete Applied Mathematics. 2008;156(9):1444-1460.
Ahlswede, R., Cicalese, F., & Deppe, C. (2008). Searching with lies under error cost constraints. Discrete Applied Mathematics, 156(9), 1444-1460.
Ahlswede, R., Cicalese, F., and Deppe, C. (2008). Searching with lies under error cost constraints. Discrete Applied Mathematics 156, 1444-1460.
Ahlswede, R., Cicalese, F., & Deppe, C., 2008. Searching with lies under error cost constraints. Discrete Applied Mathematics, 156(9), p 1444-1460.
R. Ahlswede, F. Cicalese, and C. Deppe, “Searching with lies under error cost constraints”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1444-1460.
Ahlswede, R., Cicalese, F., Deppe, C.: Searching with lies under error cost constraints. Discrete Applied Mathematics. 156, 1444-1460 (2008).
Ahlswede, Rudolf, Cicalese, Ferdinando, and Deppe, Christian. “Searching with lies under error cost constraints”. Discrete Applied Mathematics 156.9 (2008): 1444-1460.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar