This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
: Some intuitive normative principles raise vexing „detaching problems‟ by their failure to license modus ponens. I examine three such principles (a self-reliance principle and...