scientific article; zbMATH DE number 7651221

DOI10.4230/LIPICS.ESA.2020.82MaRDI QIDQ5874555FDOQ5874555

Authors: Hanrui Zhang 

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

prophet inequalitiescombinatorial welfare maximization(Approximate) subadditivity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (1)

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

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)