Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315397
DOI10.1007/b98413zbMath1095.91504OpenAlexW2615963353MaRDI QIDQ5315397
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98413
Nonnumerical algorithms (68W05) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (8)
Repeated budgeted second price ad auction ⋮ On the configuration LP for maximum budgeted allocation ⋮ The balloon popping problem revisited: lower and upper bounds ⋮ Valuated matroid-based algorithm for submodular welfare problem ⋮ Inapproximability results for combinatorial auctions with submodular utility functions ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines ⋮ Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
This page was built for publication: Algorithm Theory - SWAT 2004
