In this paper, we address the important issue of uncertainty in the edge influence probability estimates for the well studied influence maximization problem --- the task of finding k seed nodes in a… (More)

We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space are assigned to facilities that lie on the metric space, under capacity… (More)

Function computation in directed acyclic networks is considered, where a sink node wants to compute a target function with the inputs generated at multiple source nodes. The network links are… (More)

A function computation problem over a directed acyclic network has been considered in the literature, where a sink node is required to compute a target function correctly with the inputs arbitrarily… (More)

We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time can be expressed as… (More)

We study the following geometry problem: given a 2−1 dimensional vector π = {πS}S⊆[n],S 6=∅, is there an object T ⊆ R such that log(vol(TS)) = πS , for all S ⊆ [n], where TS is the projection of T to… (More)

Bridgecard is a classical trick-taking game utilizing a standard 52-card deck, in which four players in two competing partnerships attempt to “win” each round, i.e. trick. Existing theories and… (More)

Colloidal migration in a temperature gradient is referred to as thermophoresis. In contrast to particles with a spherical shape, we show that elongated colloids may have a thermophoretic response… (More)