scientific article

DOI10.4086/toc.2010.v006a011zbMath1213.68703OpenAlexW39861960MaRDI QIDQ3002824

Jan Vondrák, Uriel Feige

Publication date: 24 May 2011

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

Full work available at URL: https://doi.org/10.4086/toc.2010.v006a011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

submodular functioncombinatorial auctionwelfare maximization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (19)

Combinatorial Auctions with Conflict-Based Externalities ⋮ Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions ⋮ Near-Optimal Asymmetric Binary Matrix Partitions ⋮ Ascending-price mechanism for general multi-sided markets ⋮ Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Approximation algorithms for the partial assignment problem ⋮ Simultaneous selection ⋮ Near-optimal asymmetric binary matrix partitions ⋮ A simple optimal contention resolution scheme for uniform matroids ⋮ When Are Welfare Guarantees Robust ⋮ Scheduling to Maximize Participation ⋮ Approximation for maximizing monotone non-decreasing set functions with a greedy method ⋮ Mechanism design for perturbation stable combinatorial auctions ⋮ Online submodular maximization: beating 1/2 made simple ⋮ Approximation algorithms for vertex happiness ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ Contention resolution, matrix scaling and fair allocation ⋮ Combinatorial auctions with endowment effect

This page was built for publication: