Matching problem is a advertising was found. Roughly speaking, we deal with a bipartite graph whose vetices of a partite set are not known completely (this is what is technically called an "online" problem), while we are supposed to find a matching of as near as possible to the maximum matching of . This type of problem is the main subject of this thesis.
