Constrained multi-object auctions and \(b\)-matching

DOI10.1016/S0020-0190(00)00073-9zbMath1339.68121OpenAlexW1987571835MaRDI QIDQ294790

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

algorithmsauctionscombinatorial problemsmatchings

Mathematics Subject Classification ID

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

Related Items

Tractable combinatorial auctions and \(b\)-matching ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Fuzzy formulation of auctions and optimal sequencing for multiple auctions. ⋮ The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ Side constraints and non-price attributes in markets

Cites Work

• A polynomial algorithm for b-matchings: An alternative approach
• Computationally Manageable Combinational Auctions
• Linear Systems for Constrained Matching Problems
• Algorithm for optimal winner determination in combinatorial auctions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item