Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315397zbMATH OpenOpenAlexFDO

Authors Nir Andelman, Yishay Mansour

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Randomized algorithms (68W20) Approximation algorithms (68W25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• scientific article; zbMATH DE number 1833405
• Budget constrained auctions with heterogeneous items
• Budget-constrained auctions with heterogeneous items
• Simple combinatorial auctions with budget constraints
• Mechanisms for combinatorial auctions with budget constraints

Cited in

(24)

• Repeated budgeted second price ad auction
• 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines
• Simple combinatorial auctions with budget constraints
• On envy-free revenue approximation for combinatorial buyers with budgets
• Approximating the optimal sequence of acquisitions and sales with a capped budget
• New bounds for the balloon popping problem
• Unconditional competitive auctions with copy and budget constraints
• Budget constrained auctions with heterogeneous items
• Budget-constrained auctions with heterogeneous items
• Constrained multi-object auctions and b-matching
• Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
• First‐price auctions with budget constraints
• scientific article; zbMATH DE number 2065154 (Why is no real title available?)
• scientific article; zbMATH DE number 1833405 (Why is no real title available?)
• New bounds for the balloon popping problem
• Valuated matroid-based algorithm for submodular welfare problem
• Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
• Maximum bipartite flow in networks with adaptive channel width
• Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
• scientific article; zbMATH DE number 7703279 (Why is no real title available?)
• The balloon popping problem revisited: lower and upper bounds
• Improved truthful mechanisms for combinatorial auctions with submodular bidders
• On the configuration LP for maximum budgeted allocation
• Inapproximability results for combinatorial auctions with submodular utility functions

This page was built for publication: Algorithm Theory - SWAT 2004

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