Publication:5365114
From MaRDI portal
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
91B26: Auctions, bargaining, bidding and selling, and other market models
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
68W20: Randomized algorithms
91B68: Matching models
68W27: Online algorithms; streaming algorithms
Related Items
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order, Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming, Unnamed Item, Online Vertex-Weighted Bipartite Matching, A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines, Greedy Matching in Bipartite Random Graphs, Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios, Min-Cost Bipartite Perfect Matching with Delays, Impatient Online Matching, Stochastic Online Metric Matching, 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., Minimum Cost Perfect Matching with Delays for Two Sources, On conceptually simple algorithms for variants of online bipartite matching, Online submodular maximization: beating 1/2 made simple, Secretary and online matching problems with machine learned advice, Online allocation and display ads optimization with surplus supply, A stochastic algorithm for online bipartite resource allocation problems, On the advice complexity of online bipartite matching and online stable marriage, Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching, Minimum cost perfect matching with delays for two sources, Online spatio-temporal matching in stochastic and dynamic domains, Near optimal algorithms for online weighted bipartite matching in adversary model, 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, A \(2/3\)-approximation algorithm for vertex-weighted matching, Learn from history for online bipartite matching, Online total bipartite matching problem, Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model, Clinching auctions with online supply, Size versus truthfulness in the house allocation problem, Prompt mechanism for online auctions with multi-unit demands, Prompt Mechanism for Online Auctions with Multi-unit Demands, Social Welfare in One-Sided Matching Markets without Money, Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
