We propose to strengthen Popper's notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a short proof of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some...

We propose to strengthen Popper's notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a "short proof" of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some...

In most implementation frameworks, agents care only about the outcome and not at all about the way in which it was obtained. Additionally, typical mechanisms for full implementation involve the complete revelation of all private information to the planner. In this paper I consider the problem of...

Two players choose whether to cooperate on a project. Each of them is endowed with some evidence, and if both possess a sufficient amount then cooperation is profitable. In order to facilitate cooperation the players reveal evidence to one another. However, some players are concerned about...

This paper describes a general principle that can be used to elicit honest opinions, even if risk attitudes are unknown. JEL Classification: D83

Due to their many applications, large Bayesian games have been a subject of growing interest in game theory and related fields. But to a large extent, models (1) have been restricted to one-shot interaction, (2) are based on an assumption that player types are independent and (3) assume that the...