Randomized algorithm for MPMD on two sources

DOI10.1007/978-3-031-48974-7_20MaRDI QIDQ6609154zbMATH OpenFDO

Authors Kun He, Sizhe Li, Enze Sun, Yuyi Wang, Roger Wattenhofer, Weihao Zhu

Publication date 20 September 2024

zbMATH Keywords

randomized algorithmscompetitive analysislower boundonline matching with delay

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Cites work

• scientific article; zbMATH DE number 5764830 (Why is no real title available?)
• scientific article; zbMATH DE number 7788358 (Why is no real title available?)
• A randomized O(^2k)-competitive algorithm for metric bipartite matching
• AdWords and generalized online matching
• Competitive randomized algorithms for nonuniform problems
• Impatient Online Matching
• Maximum matching and a polyhedron with 0,1-vertices
• Min-cost bipartite perfect matching with delays
• Minimum cost perfect matching with delays for two sources
• On the advice complexity of online bipartite matching and online stable marriage
• On-line algorithms for weighted bipartite matching and stable marriages
• Online Weighted Matching
• Online matching and ad allocation
• Online matching: haste makes waste!
• Online vertex-weighted bipartite matching and single-bid budgeted allocations
• Paths, Trees, and Flowers
• Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
• Randomized online algorithms for minimum metric bipartite matching
• Randomized primal-dual analysis of RANKING for online bipartite matching

Cited in

(1)

• MPMD on two sources with lookahead

This page was built for publication: Randomized algorithm for MPMD on two sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609154)