ALGORITHMIK DES MATCHINGS UNTER PRÄFERENZ von David (Univ of Glasgow, UK) Manlove
208,76 €
Matching problems with preferences are all around us: they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide.
Jetzt bei Ebay:
