We study school switches in which students who have already been assigned seats request reassignment. Unlike in regular school choice, stability need not be legally binding in such programs, since students' priority-based claims have already been satisfied upstream. Efficiency then naturally...

How does a search engine company decide which advertisements to display for each query to maximize its revenue? This turns out to be a generalization of the online bipartite matching problem. In this paper, search engines decide the strategy to allocate resources with an advertiser credibility...

The aim of the paper is to develop algorithms for the matching of strings from two different registers of Italian enterprises. This makes effective the possibility of integrating the firm-level information collected by ISAE (Institute for Studies and Economic Analyses) with the one gathered by...