Revenue submodularity

DOI10.4086/TOC.2012.V008A002MaRDI QIDQ2913805zbMATH OpenOpenAlexFDO

Authors Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan

Publication date 27 September 2012

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2012.v008a002

zbMATH Keywords

monotonicitysubmodularityrevenueVCGoptimal auctions

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• On revenue monotonicity in combinatorial auctions
• Simple mechanisms for subadditive buyers via duality
• Submodular secretary problem and extensions
• Submodular secretary problem and extensions
• Approximate revenue maximization with multiple items

Cited in

(15)

• A unifying look at sequence submodularity
• Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
• A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
• A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
• Auction timing and market thickness
• A tight linear time (1/2)-approximation for unconstrained submodular maximization
• The VCG Mechanism for Bayesian Scheduling
• Robust auctions for revenue via enhanced competition
• Online BP functions maximization
• Revenue monotonicity under misspecified bidders
• On a modification of the VCG mechanism and its optimality
• Revenue maximization with a single sample
• Allocating revenues in a Smart TV ecosystem
• Matroid rank functions and discrete concavity
• Online submodular maximization with preemption

This page was built for publication: Revenue submodularity

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