Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMATH Open1095.91504OpenAlexW2615963353MaRDI QIDQ5315397FDOQ5315397

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

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

Mathematics Subject Classification ID

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

Cited In (23)

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

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)