TITLE: The second level of the polynomial hierarchy

The talk surveys and discusses a number of algorithmic problems
located at the second level of the polynomial hierarchy.  The
problems are taken from geometry, graph theory, social choice,
and robust optimization. They have been picked for expository
reasons: some of them are genuinely hard, while others only
pretend to be intractable.