SODA
2007
ACM
14 years 2 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
ICALP
2009
Springer
15 years 27 days ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...