scientific article; zbMATH DE number 7651221

DOI10.4230/LIPICS.ESA.2020.82MaRDI QIDQ5874555zbMATH OpenFDO

Authors Hanrui Zhang

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2020.82

zbMATH Keywords

(Approximate) subadditivitycombinatorial welfare maximizationprophet inequalities

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Combinatorial auctions via posted prices
• Combinatorial prophet inequalities
• Matroid prophet inequalities
• Multi-parameter mechanism design and sequential posted pricing
• On maximizing welfare when utility functions are subadditive
• Polymatroid Prophet Inequalities
• Prophet secretary for combinatorial auctions and matroids
• Semiamarts and finite values
• Simple mechanisms for subadditive buyers via duality
• The communication requirements of efficient allocations and supporting prices

Cited in

(1)

• An O(\log \log m) Prophet Inequality for Subadditive Combinatorial Auctions

Describes a project that uses

Uses Software

• Sociodynamica

This page was built for publication:

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