Skip to main content
Article thumbnail
Location of Repository

How to hide information for later use on networks

By Steve Alpern and Robbert Fokkink

Abstract

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

Topics: HB Economic Theory
Year: 2009
OAI identifier: oai:eprints.lse.ac.uk:27683
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.gamenets.org/ (external link)
  • http://eprints.lse.ac.uk/27683... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.