scientific article
From MaRDI portal
Publication:2913805
DOI10.4086/toc.2012.v008a002zbMath1246.91054OpenAlexW4253784538MaRDI QIDQ2913805
Mukund Sundararajan, Shaddin Dughmi, Tim Roughgarden
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization ⋮ The VCG Mechanism for Bayesian Scheduling ⋮ Matroid rank functions and discrete concavity ⋮ Auction timing and market thickness ⋮ A unifying look at sequence submodularity ⋮ Unnamed Item ⋮ On a modification of the VCG mechanism and its optimality ⋮ Online BP functions maximization ⋮ Online Submodular Maximization with Preemption ⋮ Robust Auctions for Revenue via Enhanced Competition ⋮ A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint ⋮ A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints ⋮ Revenue maximization with a single sample
This page was built for publication:
