En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents 90C40 1 results

Filter
Select: All / None
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
This talk will cover two recent advancements in the theory of online algorithms for dynamic matching markets. The first set of results concern a stochastic model of matching with Poisson arrivals and memoryless departures over edge-weighted graphs. The second set of results focus on the incorporation of serial correlation properties in classical online stochastic matching models. We develop new mathematical programming relaxations and correlated rounding schemes, yielding the first constant-factor performance guarantees in such settings.[-]
This talk will cover two recent advancements in the theory of online algorithms for dynamic matching markets. The first set of results concern a stochastic model of matching with Poisson arrivals and memoryless departures over edge-weighted graphs. The second set of results focus on the incorporation of serial correlation properties in classical online stochastic matching models. We develop new mathematical programming relaxations and correlated ...[+]

05C85 ; 90C40 ; 91B68 ; 90C35

Bookmarks Report an error