Abstract: In this talk, we introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade.

Abstract:

The $delta$-coin problem asks if a given function can distinguish between coins which are sampled independently with the probability of heads being $1/2+ \delta$ and those where the probability of heads is 1/2.

A tree is said to be n-universal if it "contains" all binary trees with at most n leaves. A result of Chung, Graham and Coppersmith from 1981 shows that when this containment is via sub-graphs, an n-universal tree requires size n^Omega(log(n)).

Abstract: The first observation that one makes when analyzing communication protocols between Alice and Bob is that a cost c protocol partitions the input space into 2^c combinatorial rectangles.

Abstract: A famous result of Ahlswede in the theory of Arbitrarily Varying Channels (AVCs) stated that the deterministic coding capacity of an AVC is either zero or is equal to its random coding capacity.