We study how to regulate a monopolistic firm using a robust-design, non-Bayesian approach. We derive a policy that minimizes the regulator's worst-case regret, where regret is the difference between the regulator's complete-information payoff and his realized payoff. When the regulator's payoff...

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...