Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in that limit of infinite vector length, certain quantization-based strategie...
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through barg...
The use of trimming procedures constitutes a natural approach to robustifying statistical methods. This is the case of goodness-of-fit tests based on a distance, which can be modi...
Pedro C. Alvarez-Esteban, Eustasio del Barrio, Jua...