Tractable combinatorial auctions and \(b\)-matching

DOI10.1016/S0004-3702(02)00229-1zbMath0999.68003MaRDI QIDQ1614868

Moshe Tennenholtz

Publication date: 9 September 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

electronic commerce\(b\)-matchingcombinatorial auctions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10)

Related Items (13)

Hierarchical \(b\)-matching ⋮ Bundling equilibrium in combinatorial auctions ⋮ A flexible model for tree-structured multi-commodity markets ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ Exact algorithms for the matrix bid auction ⋮ Combinatorial auctions with decreasing marginal utilities ⋮ Side constraints and non-price attributes in markets ⋮ On the choice of obtaining and disclosing the common value in auctions ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ Combinatorial auctions for electronic business ⋮ Allocation of advertising space by a web service provider using combinatorial auctions ⋮ BOB: Improved winner determination in combinatorial auctions and generalizations

Cites Work

• Unnamed Item
• Constrained multi-object auctions and \(b\)-matching
• A polynomial algorithm for b-matchings: An alternative approach
• Negotiation and cooperation in multi-agent environments
• Computationally Manageable Combinational Auctions
• Optimal auctions revisited
• Auction protocols for decentralized scheduling

This page was built for publication: Tractable combinatorial auctions and \(b\)-matching