Describir: On computational tractability for rational verification