Constrained multi-object auctions and b-matching

DOI10.1016/S0020-0190(00)00073-9MaRDI QIDQ294790zbMATH OpenOpenAlexFDO

Authors Moshe Tennenholtz, Michal Penn

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000000739?np=y

zbMATH Keywords

algorithmscombinatorial problemsmatchingsauctions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Recommendations

• On multi-object auctions and matching theory: algorithmic aspects
• Tractable combinatorial auctions and \(b\)-matching
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2065154
• Combinatorial auctions

Cites work

• scientific article; zbMATH DE number 19089 (Why is no real title available?)
• scientific article; zbMATH DE number 3499169 (Why is no real title available?)
• scientific article; zbMATH DE number 3566230 (Why is no real title available?)
• scientific article; zbMATH DE number 3637616 (Why is no real title available?)
• A polynomial algorithm for b-matchings: An alternative approach
• Algorithm for optimal winner determination in combinatorial auctions
• Computationally manageable combinational auctions
• Linear Systems for Constrained Matching Problems

Cited in

(9)

• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
• Fuzzy formulation of auctions and optimal sequencing for multiple auctions.
• Multiple-object auctions with budget constrained bidders
• On multi-object auctions and matching theory: algorithmic aspects
• scientific article; zbMATH DE number 1927296 (Why is no real title available?)
• Comparing multiagent systems research in combinatorial auctions and voting
• Tractable combinatorial auctions and \(b\)-matching
• Side constraints and non-price attributes in markets
• The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions

This page was built for publication: Constrained multi-object auctions and \(b\)-matching

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