1st International Conference on Game Theory for Networks

Research Article

How to hide information for later use on networks

  • @INPROCEEDINGS{10.1109/GAMENETS.2009.5137456,
        author={Steve  Alpern  and Robbert  Fokkink},
        title={How to hide information for later use on networks},
        proceedings={1st International Conference on Game Theory for Networks},
        publisher={IEEE},
        proceedings_a={GAMENETS},
        year={2009},
        month={6},
        keywords={},
        doi={10.1109/GAMENETS.2009.5137456}
    }
    
  • Steve Alpern
    Robbert Fokkink
    Year: 2009
    How to hide information for later use on networks
    GAMENETS
    IEEE
    DOI: 10.1109/GAMENETS.2009.5137456
Steve Alpern 1,*, Robbert Fokkink2,*
  • 1: London School of Economics, Department of Applied Mathematics, Houghton Street, London W2A, UK.
  • 2: Institute of Applied Mathematics, Delft University of Technology, P.O Box 5031, 2600GA Delft, Netherlands.
*Contact email: s.alpern@lse.ac.uk, r.j.fokkink@tudelft.nl

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.