Is it possible to design truthful polynomial-time mechanisms that achieve a good approximation ratio? This is one of the basic questions in Algorithmic Mechanism Design. The focus of most of the work on this question is on settings in which on one hand there exists a truthful algorithm that maximizes the social welfare (VCG), but on the other hand computing the optimal solution is computational...

Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.

This report describes a classification algorithm developed by the Johns Hopkins University Applied Physics Laboratory for use in evaluating data collected by the Preliminary Credibility Assessment System (PCASS). The PCASS instrument measures two physiological signals during a specifically generated structured interview and the embedded classification algorithm provides an indication of whether...

Lying is a common phenomenon amongst human beings. It seems to play a role in making social interactions run more smoothly. Too much honesty can be regarded as impolite or downright rude. Remarkably, lying is not a common phenomenon amongst normally intelligent human beings who are on the autism spectrum. They appear to be 'attractively morally innocent' and seem to have an above average moral ...

32 Acknowledgements Thanks are due to Frans Voorbraak for providing us with example 3.12. 31 (2) after the agent performs the action s/he should know that s/he had just performed the action 5. (3) the agent knows that the observable result holds after the test is performed just in case that the observable precondition was true before the test was performed. These demands diier substantially fro...