-
On Computing Pareto Stable Assignments
International audience -
Complexity of games dynamics
Complexity theory allows to classify problems by their algorithmic hardness. The classical framework in which it applies is the one of a centralized algorithm that... -
Two-sided matching with one-sided preferences
In a school choice context we show that considering only schools' priorities and the set of acceptable schools for each student - but not how these schools are ranked...
