This paper analyzes information reporting by a privately informed expert concerned about being perceived to have accurate information. When the expert’s reputation is updated on the basis of the report as well as the realized state, the expert typically does not wish to truthfully reveal the signal observed. The incentives to deviate from truthtelling are characterized and shown to depend on th...

We consider a cheap-talk setting in which the sender can use information about the receiver’s preferences to tailor communication. Better information increases the persuasion ability of the sender, but also results in receiver skepticism. When the sender’s motives are transparent to the receiver, trade always relies on the sender not being too well-informed about the receiver’s preferences. In ...

We model alternating-announcements cheap talk, while discussing the efficiency consequences of explicitly allowing the ‘no-agreement’ outcome of the game with communication to vary with players’ cheap talk announcements. Our results give further consistency to the argument that a cheap talk extension does not necessarily imply efficiency in the play of the original game. Moreover, we characteri...

Dynamic cheap eagerness extends cheap eagerness by allowing the decision of whether to build a thunk or speculatively evaluate its body to be deferred until run time. We have implemented this optimi-sation in a compiler for a simple functional language and measured its eeect on a few benchmarks. It turns out that a large part of the overhead of graph reduction can be eliminated, but that run-ti...

This article demonstrates how a powerful and expressive abstraction from concurrency theory plays a dual rôle as a programming tool for concurrent applications and as a foundation for their verification. This abstraction—monads of resumptions expressed using monad transformers—is cheap: it is easy to understand, easy to implement, and easy to reason about. We illustrate the expressiveness of th...

It is known that requiring a controlled system to be decoupled may increase costs in terms of some performance measures. However, decoupling may be desirable from an applied perspective. This paper gives an explicit quantiication of the costs of decoupling. In particular, the average quadratic tracking error is used to quantify performance. The analysis exploits the parametrisation of all decou...

Tupling is a well-known transformation tactic to obtain new recursive functions without redundant recursive calls and/or multiple traversals of common data, which is achieved by grouping some recursive functions into a tuple. Although being studied for a long time based on fold/unfold transformation, it su ers from the high cost of keeping track of function calls and has to use clever control t...