We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...