Title
Two cooperative versions of the Guessing Secrets problem
Abstract
We investigate two cooperative variants (with and without lies) of the Guessing Secrets problem, introduced in [L. Chung, R. Graham, F.T. Leighton, Guessing secrets, Electronic Journal of Combinatorics 8 (2001)] in the attempt to model an interactive situation arising in the World Wide Web, in relation to the efficient delivery of Internet content. After placing bounds on the cardinality of the smallest set of questions needed to win the game, we establish that the algebra of all the states of knowledge induced by any designated game is a pseudocomplemented lattice. In particular, its join semilattice reduct is embeddable into the corresponding reduct of the Boolean algebra 2^N^-^1, where N is the cardinality of the search space.
Year
DOI
Venue
2009
10.1016/j.ins.2009.06.014
Inf. Sci.
Keywords
Field
DocType
semilattice reduct,boolean algebra,cooperative variant,cooperative version,guessing secrets problem,guessing secret,l. chung,corresponding reduct,world wide web,electronic journal,internet content,search space,fuzzy logic
Discrete mathematics,Reduct,Combinatorics,Lattice (order),Computer science,Fuzzy logic,Cardinality,Boolean algebra,Artificial intelligence,Semilattice,Machine learning,The Internet
Journal
Volume
Issue
ISSN
179
20
0020-0255
Citations 
PageRank 
References 
2
0.38
13
Authors
8
Name
Order
Citations
PageRank
Giuseppe Sergioli12311.03
A. Ledda221.06
francesco paoli382.49
roberto giuntini4183.55
tomasz kowalski541.54
F. Montagna6494.98
Hector Freytes7229.37
C. Marini820.38