How to hide information for later use on networks

Authors:
Steve Alpern;Robbert Fokkink
Affiliations:
London School of Economics, Department of Applied Mathematics, London, UK;Institute of Applied Mathematics, Delft University of Technology, Delft, Netherlands
Venue:
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Year:
2009

Citing 4
Cited 0

A mixed-strategy minimax theorem without compactness

SIAM Journal on Control and Optimization
Accumulation games, part 1: noisy search

Journal of Optimization Theory and Applications
How to share a secret

Communications of the ACM
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an accumulation game a Hider secretly distributes his given total wealth h1 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.