scientific article; zbMATH DE number 7375998

DOI10.4230/LIPIcs.ICALP.2018.71zbMath1499.68413arXiv1804.08172MaRDI QIDQ5002749

Anupam Gupta, Marco Molinaro, Ruta Mehta

Publication date: 28 July 2021

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

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

zbMATH Keywords

online algorithmsconvex dualitysecretary problemrandom order

Mathematics Subject Classification ID

Convex programming (90C25) Stopping times; optimal stopping problems; gambling theory (60G40) Combinatorial aspects of matroids and geometric lattices (05B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Machine covering in the random-order model ⋮ Scheduling In the random-order model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How the Experts Algorithm Can Help Solve LPs Online
• Secretary Problems with Convex Costs
• Geometry of Online Packing Linear Programs
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• A Knapsack Secretary Problem with Applications
• The Secretary Problem and Its Extensions: A Review
• Primal beats dual on online packing LPs in the random-order model
• Fast Algorithms for Online Stochastic Convex Programming
• Welfare Maximization with Production Costs: A Primal Dual Approach
• A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
• Welfare and Profit Maximization with Production Costs

This page was built for publication: