Аннотация:We consider the parking permit problem with three permit types. First, we prove the tight lower bound on the competitiveness of any deterministic online algorithm. Next, we present a learning-augmented algorithm and show its’ consistency and robustness.