Approximation algorithms for combinatorial auctions with complement-free bidders

DOI10.1145/1060590.1060681zbMath1192.68890OpenAlexW2126085282MaRDI QIDQ3581408

Shahar Dobzinski, Michael Schapira, Noam Nisan

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060681

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (21)

Single-Parameter Combinatorial Auctions with Partially Public Valuations ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ Optimal item pricing in online combinatorial auctions ⋮ Quality of local equilibria in discrete exchange economies ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Cost sharing in two-sided markets ⋮ Optimization with demand oracles ⋮ Geometric rounding: A dependent randomized rounding scheme ⋮ Unnamed Item ⋮ Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Limitations of VCG-based mechanisms ⋮ Inapproximability results for combinatorial auctions with submodular utility functions ⋮ Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents ⋮ Maximizing a class of submodular utility functions with constraints ⋮ Maximizing a class of submodular utility functions ⋮ Truthful approximation mechanisms for restricted combinatorial auctions ⋮ Truthful mechanisms for two-range-values variant of unrelated scheduling ⋮ A lower bound for scheduling mechanisms ⋮ Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders ⋮ Unnamed Item

This page was built for publication: Approximation algorithms for combinatorial auctions with complement-free bidders