Vande Vate (1989) described the polytope whose extreme points are the stable (core) matchings in the Marriage Problem. Rothblum (1989) simplified and extended this result. This paper explores a ...

“I’m not going to be talking about a CDN,” said Jason Burgess, a Comcast software and systems architect, during his Content Delivery Summit 2014 keynote address. “Today, I’d like to talk to you about ...

Roth, A. E., U. G. Rothblum, and J. H. Vande Vate. "Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 ...