Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Selling ad campaigns: online algorithms with cancellations
Proceedings of the 10th ACM conference on Electronic commerce
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Improved competitive ratios for submodular secretary problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On variants of the matroid secretary problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Improved competitive ratio for the matroid secretary problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online vertex-weighted bipartite matching and single-bid budgeted allocations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Matroid secretary problem in the random assignment model
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Interviewing secretaries in parallel
Proceedings of the 13th ACM Conference on Electronic Commerce
Secretary problems with convex costs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Advances on matroid secretary problems: free order model and laminar case
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Recent advances on the matroid secretary problem
ACM SIGACT News
Hi-index | 0.00 |
Consider a bipartite graph with a set of left-vertices and a set of right-vertices. All the edges adjacent to the same left-vertex have the same weight. We present an algorithm that, given the set of right-vertices and the number of left-vertices, processes a uniformly random permutation of the left-vertices, one left-vertex at a time. In processing a particular left-vertex, the algorithm either permanently matches the left-vertex to a thus-far unmatched right-vertex, or decides never to match the left-vertex. The weight of the matching returned by our algorithm is within a constant factor of that of a maximum weight matching.