论文信息 - How to hide information for later use on networks

How to hide information for later use on networks

In an accumulation game a Hider secretly distributes his given total wealth h≫1 among n locations while a Searcher picks r locations and confiscates the material placed there. The Hider wins if what is left at the remaining locations is at least 1 otherwise the Searcher wins. Accumulation games were originally introduced to study certain covert activities, but the game also relates to secret sharing and food caching. In this paper we introduce a network structure on the game, restricting the Searcher to pick locations that are near and show how this leads to combinatorial considerations.

Steve Alpern | Robbert Fokkink

[1] W. Ruckle,et al. Accumulation Games, Part 1: Noisy Search , 1997 .

[2] Adi Shamir,et al. How to share a secret , 1979, CACM.

[3] Gyula O. H. Katona. A simple proof of the Erd?s-Chao Ko-Rado theorem , 1972 .

[4] Steve Alpern,et al. A mixed-strategy minimax theorem without compactness , 1988 .

[5] Desmond Morris,et al. THE BEHAVIOUR OF THE GREEN ACOUCHI (MYOPROCTAPRATTI) WITH SPECIAL REFERENCE TO SCATTER HOARDING , 2009 .

[6] William H. Ruckle,et al. Initial Point Search on Weighted Trees , 1994 .

[7] Ludolf E. Meester. Extremal distributions for tail probabilities of sums of iid random variables on [0,1] , 2008 .

[8] William H. Ruckle,et al. Continuous accumulation games on discrete locations , 2002 .

[9] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .