This paper analyzes the problem of selecting a set of items whose prices are to be updated in the next iteration in so called simple ascending auctions with unit-demand bidders. A family of sets called "sets in excess demand" is introduced, and the main results demonstrate that a simple...

We study two-sided ("marriage") and general pairing ("roommate") problems. We introduce "sequences," lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition,...