A stochastic algorithm for online bipartite resource allocation problems

DOI10.1016/J.COR.2016.05.004MaRDI QIDQ342502zbMATH OpenOpenAlexFDO

Authors Antoine Legrain, Patrick Jaillet

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.05.004

zbMATH Keywords

online optimizationstochastic optimizationresource allocationprimal-dual algorithmadwords problemL-shaped method

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Stochastic programming (90C15) Integer programming (90C10)

Recommendations

• Online stochastic matching: new algorithms with better bounds
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• Online stochastic packing applied to display ad allocation
• AdWords and generalized online matching
• scientific article; zbMATH DE number 7053386

Cites work

• scientific article; zbMATH DE number 5764830 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2110665 (Why is no real title available?)
• A dynamic near-optimal algorithm for online linear programming
• AdWords and generalized online matching
• An introduction to randomized algorithms
• An optimal deterministic algorithm for online \(b\)-matching
• Introduction to stochastic programming.
• Model predictive control for dynamic resource allocation
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• Online Stochastic Matching: Beating 1-1/e
• Online bipartite matching with unknown distributions
• Online stochastic matching: new algorithms with better bounds
• Online stochastic packing applied to display ad allocation
• Online traveling salesman problems with service flexibility
• Online vertex-weighted bipartite matching and single-bid budgeted allocations
• Partitioning procedures for solving mixed-variables programming problems
• Primal beats dual on online packing LPs in the random-order model
• Robust discrete optimization and network flows

Cited in

(17)

• Decentralized online integer programming problems with a coupling cardinality constraint
• An on-line assignment problem with random effectiveness and costly information
• Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
• Model predictive control for dynamic resource allocation
• Online resource allocation with personalized learning
• A hybrid algorithm for the adwords problem
• The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
• Competitive online algorithms for resource allocation over the positive semidefinite cone
• Fair resource allocation in a volatile marketplace
• Online generalized assignment problem with historical information
• Algorithmic Challenge in Online Advertising
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• Online spatio-temporal matching in stochastic and dynamic domains
• An improved optimization algorithm of ads' allocation in sponsored search and the results of experiments
• scientific article; zbMATH DE number 7053386 (Why is no real title available?)
• Online resource allocation under partially predictable demand
• Learn from history for online bipartite matching

This page was built for publication: A stochastic algorithm for online bipartite resource allocation problems

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