Alpern, Steve and Fokkink, Robbert (2009) How to hide information for later use on networks. In: Game Theory for Networks (GameNets 2009), 2009-01-01.
Full text not available from this repository.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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://www.gamenets.org/ |
| Additional Information: | © 2009 The authors |
| Divisions: | Mathematics |
| Subjects: | H Social Sciences > HB Economic Theory |
| Date Deposited: | 09 Apr 2010 14:32 |
| Last Modified: | 13 Sep 2024 14:05 |
| URI: | http://eprints.lse.ac.uk/id/eprint/27683 |
Actions (login required)
 |
View Item |
