Smart elements in combinatorial group testing problems

Dániel Gerbner () and Máté Vizer ()
Additional contact information
Dániel Gerbner: MTA Rényi Institute
Máté Vizer: MTA Rényi Institute

Journal of Combinatorial Optimization, 2018, vol. 35, issue 4, No 3, 1042-1060

Abstract: Abstract In combinatorial group testing problems the questioner needs to find a special element $$x \in [n]$$ x ∈ [ n ] by testing subsets of [n]. Tapolcai et al. (in: Proceedings of IEEE INFOCOM, Toronto, Canada, pp 1860–1868, 2014; IEEE Trans Commun 64(6):2527–2538, 2016) introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the special one. Using classical results of extremal set theory we prove that if $$\mathcal {F}_n \subseteq 2^{[n]}$$ F n ⊆ 2 [ n ] solves the non-adaptive version of this problem and has minimal cardinality, then $$\begin{aligned} \lim _{n \rightarrow \infty } \frac{|\mathcal {F}_n|}{\log _2 n} = \log _{(3/2)}2. \end{aligned}$$ lim n → ∞ | F n | log 2 n = log ( 3 / 2 ) 2 . This improves results in Tapolcai et al. (2014, 2016). We also consider related models inspired by secret sharing models, where the elements should share information among them to find out the special one. Finally the adaptive versions of the different models are investigated.

Keywords: Combinatorial group testing; Non-adaptive; Information sharing (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0248-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0248-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0248-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().