Group Testing Game

Abstract Group testing offers a cost/time-beneficial method to identify all, but few, infected individuals (defective items in general) among a large set of individuals (items). In a group testing scheme, a series of tests are performed on groups of individuals rather than single individuals. A test on a group determines whether the group contains at least one infected individual. This paper investigates the classical group testing problem from a game-theoretic perspective, where every individual, once called for a test, decides to comply with or defy the call. In this framework, an individual’s decision is driven by his knowledge of his well-being, that is healthy or infected. This leads to the so-called group testing game which is formulated in this work. Some simplified versions of the general game as a team game is then presented and analyzed, that result in some novel, generalized group testing problems to be addressed in future work.

[1]  A. Macula.  Probabilistic nonadaptive group testing in the presence of errors and DNA library screening , 1999 .

[2]  Jack K. Wolf,et al.  Born again group testing: Multiaccess communications , 1985, IEEE Trans. Inf. Theory.

[3]  George Atia,et al.  Noisy group testing: An information theoretic perspective , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[5]  Morteza Zadimoghaddam,et al.  Sequential group testing with graph constraints , 2012, 2012 IEEE Information Theory Workshop.

[6]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[7]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[8]  Mikhail J. Atallah,et al.  Private combinatorial group testing , 2008, ASIACCS '08.

[9]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[10]  Jun Cheng,et al.  T-User Code with Arbitrary Code Length for Multiple-Access Adder Channel (Special Section on Information Theory and Its Applications) , 1999 .

[11]  Olgica Milenkovic,et al.  Semiquantitative Group Testing , 2014, IEEE Transactions on Information Theory.

[12]  Tadashi Wadayama,et al.  An analysis on non-adaptive group testing based on sparse pooling graphs , 2013, 2013 IEEE International Symposium on Information Theory.

[13]  Amin Karbasi,et al.  Graph-Constrained Group Testing , 2010, IEEE Transactions on Information Theory.

[14]  Pingzhi Fan,et al.  Superimposed codes for the multiaccess binary adder channel , 1995, IEEE Trans. Inf. Theory.

[15]  Dino Sejdinovic,et al.  Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  Hung-Lin Fu,et al.  Nonadaptive algorithms for threshold group testing , 2009, Discret. Appl. Math..

[17]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[18]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.