Maintaining Privacy on a Line
Consider a situation where people have to choose among a sequence of n linearly ordered positions to perform some task requiring a certain amount of privacy. Which position should one choose so as to maximize one's privacy, i. e., minimize the chances that one of your neighboring positions becomes occupied by a later arrival? In this paper, we attempt to answer this question under a variety of models for the behavior of the later arrivals. Our results suggest that for the most part one should probably choose one of the extreme positions (with some interesting exceptions). We also suggest a number of variations on the problem that lead to many open problems.
|Keywords||Line graph, Obnoxious facility location problem, Privacy, Unfriendly seating arrangement problem|
|Journal||Theory of Computing Systems|
Kranakis, E, & Krizanc, D. (Danny). (2012). Maintaining Privacy on a Line. Theory of Computing Systems, 50(1), 147–157. doi:10.1007/s00224-011-9338-3