Bicriteria Online Matching: Maximizing Weight and Cardinality

DOI10.1007/978-3-642-45046-4_25zbMath1406.91280OpenAlexW2285500630MaRDI QIDQ2937766

Nitish Korula, Morteza Zadimoghaddam, Vahab S. Mirrokni

Publication date: 12 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45046-4_25

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Marketing, advertising (90B60) Matching models (91B68) Internet topics (68M11)

Related Items (1)

Online allocation and display ads optimization with surplus supply

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair online load balancing
• Pareto approximations for the bicriteria scheduling problem
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Online Stochastic Weighted Matching: Improved Approximation Algorithms
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• Online Stochastic Packing Applied to Display Ad Allocation
• Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
• Online Stochastic Matching: Beating 1-1/e
• Online bipartite matching with unknown distributions
• Online bipartite matching with random arrivals
• Combining fairness with throughput: Online routing with multiple objectives

This page was built for publication: Bicriteria Online Matching: Maximizing Weight and Cardinality