A dynamic learning algorithm for online matching problems with concave returns

DOI10.1016/j.ejor.2015.06.029zbMath1346.90824OpenAlexW1954002856MaRDI QIDQ319996

Zizhuo Wang, Xiao Alison Chen

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.029

zbMATH Keywords

online algorithmsrandom permutation modelprimal-dualadwords problemdynamic price update

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Competitive analysis of the online financial lease problem ⋮ Learn from history for online bipartite matching

Cites Work

• Unnamed Item
• Unnamed Item
• Weak convergence and empirical processes. With applications to statistics
• Geometry of Online Packing Linear Programs
• Bayesian Mechanism Design
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Online Primal-Dual Algorithms for Covering and Packing
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• Online Stochastic Packing Applied to Display Ad Allocation
• Online matching with concave returns

This page was built for publication: A dynamic learning algorithm for online matching problems with concave returns