input at terminal 2 and Y2 the corresponding output. Once each second, say, new inputs xi and x2 may be chosen from corresponding input alphabets and put into the channel; outputs yi and Y2 may then be observed. These outputs will be related statistically to the inputs and perhaps historically to previous inputs and outputs if the channel has memory. The problem is to communicate in both direct...

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction...

This paper experimentally investigates free-riding behavior on communication cost in a coordination game and finds strong indications of such free-riding. Firstly, the subjects wait for others to send a message when communication is costly, which does not happen when communication is costless. Secondly, the proportion of games where no communication or one-way communication takes place is much ...

Alice and Bob are connected via a two-way binary channel. This paper describes an algorithm to enable Alice to send a message to Bob when 1) an oblivious adversary flips an unknown number of bits, T , on the channel; and 2) the message length L, and a desired error probability, ǫ are public knowledge. With probability at least 1− ǫ, our algorithm ensures that Bob receives the correct message, a...