scientific article; zbMATH DE number 6783466

zbMath1375.68221arXiv1007.1271MaRDI QIDQ5365114

Aranyak Mehta, Gagan Aggarwal, Gagan Goel, C. Karande

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1007.1271

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Randomized algorithms (68W20) Matching models (91B68) Online algorithms; streaming algorithms (68W27)

Related Items (38)

Minimum Cost Perfect Matching with Delays for Two Sources ⋮ Minimum cost perfect matching with delays for two sources ⋮ A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm ⋮ Online total bipartite matching problem ⋮ Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ A stochastic algorithm for online bipartite resource allocation problems ⋮ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order ⋮ Greedy Matching in Bipartite Random Graphs ⋮ Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming ⋮ Near optimal algorithms for online weighted bipartite matching in adversary model ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ Secretary and online matching problems with machine learned advice ⋮ Online allocation and display ads optimization with surplus supply ⋮ Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching ⋮ Unnamed Item ⋮ Clinching auctions with online supply ⋮ Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios ⋮ Min-Cost Bipartite Perfect Matching with Delays ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Online algorithms for maximum cardinality matching with edge arrivals ⋮ Stable secretaries ⋮ Online stochastic matching: new algorithms and bounds ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Online submodular maximization: beating 1/2 made simple ⋮ Online Vertex-Weighted Bipartite Matching ⋮ Social Welfare in One-Sided Matching Markets without Money ⋮ Impatient Online Matching ⋮ Stochastic Online Metric Matching ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Size versus truthfulness in the house allocation problem ⋮ Online Algorithms for Maximum Cardinality Matching with Edge Arrivals ⋮ Online Stochastic Matching: New Algorithms with Better Bounds ⋮ Online Submodular Maximization Problem with Vector Packing Constraint. ⋮ Learn from history for online bipartite matching ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands

This page was built for publication: