Approximation algorithms for budget-constrained auctions

DOI10.1007/3-540-44666-4_14MaRDI QIDQ4780786zbMATH OpenFDO

Authors Rahul Garg, V. Kumar, Vinayaka Pandit

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2129/21290102

zbMATH Keywords

approximation algorithmauctionsroundingwinner determination

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• Auctions with budget constraints
• Budget constrained auctions with heterogeneous items
• Budget-constrained auctions with heterogeneous items
• Simple combinatorial auctions with budget constraints
• Unconditional competitive auctions with copy and budget constraints

Cited in

(18)

• Time bounds for iterative auctions: a unified approach by discrete convex analysis
• Approximation algorithms for the max-buying problem with limited supply
• A speedy auction using approximated bidders' preferences
• Approximating the optimal sequence of acquisitions and sales with a capped budget
• Unconditional competitive auctions with copy and budget constraints
• Approximation algorithms for a winner determination problem of single-item multi-unit auctions
• Distributed submodular maximization
• Improved Approximation Algorithms for Budgeted Allocations
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation Schemes for Multi-Budgeted Independence Systems
• Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
• scientific article; zbMATH DE number 2065154 (Why is no real title available?)
• Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
• Valuated matroid-based algorithm for submodular welfare problem
• Auction/Belief Propagation Algorithms for Constrained Assignment Problem
• Auctions with budget constraints
• Interval subset sum and uniform-price auction clearing
• On the configuration LP for maximum budgeted allocation

This page was built for publication: Approximation algorithms for budget-constrained auctions

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