The cut polyhedron cut(G) of an undirected graph G = (V,E) is the dominant of the convex hull of all of its nonempty edge cutsets. After examining various compact extended formulations for cut(G), we study some of its polyhedral properties. In particular, we characterize all of the facets...

We consider a politician's choice of whether to be evaluated, as by subjecting himself to a detailed interview or by asking for the appointment of a special prosecutor. We find that both when politicians do and do not know the quality of their own actions, stable equilibria may exist in which...