We consider the problem of optimal information sharing in the context of a service system. In particular, we consider an unobservable single server queue offering service at a fixed price to a Poisson arrival of delay-sensitive customers.
A martingale is a sequence of random variables that maintain their future expected value conditioned on the past. A $[0,1]$-bounded martingale is said to polarize if it converges in the limit to either $0$ or $1$ with probability $1$. A martinga
We present a geometric approach towards derandomizing the Isolation lemma for a given family, i.e., deterministically constructing a weight assingnment which ensures a unique minimum weight set in the family.
Information theoretically secure multi-party computation (MPC) has been a central primitive of modern cryptography, in which mutually distrusting parties collaborate to compute a function of their private data without revealing any additional info
We look at the boolean function in which the input is a boolean matrix with the promise that either 2/3rd of its rows contain a 1 or 2/3rd of its rows do not contain a 1.
The talk will be on load balancing on a large graph. A unit of load on each edge of a graph is to be distributed between its nodes in a balanced way. On infinite graphs, it is known that the problem exhibits nonuniqueness.
The packing lemma of Haussler (J. of Comb. Theory, Ser. A, 1995) states that given a set system with bounded VC dimension, if every pair of sets in the set system have large symmetric difference, then the set system cannot contain too many sets.
Discrete default intensity based or logit type models are commonly used as reduced form models for conditional default probabilities for corporate loans where this default probability depends upon macroeconomic as well as firm-specific covariates.