BOB: Improved winner determination in combinatorial auctions and generalizations

DOI10.1016/S0004-3702(03)00015-8zbMath1082.68813OpenAlexW1965686263MaRDI QIDQ814442

Subhash Suri, Tuomas W. Sandholm

Publication date: 7 February 2006

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(03)00015-8

zbMATH Keywords

Combinatorial auctionAuctionMultiagent systemsBidding with synergiesMulti-item auctionMulti-object auctionWinner determination

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)

Related Items

A hybrid ant colony algorithm for the winner determination problem, A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions, An interactive approach for bi-attribute multi-item auctions, Comparing multiagent systems research in combinatorial auctions and voting, Information-theoretic approaches to branching in search, Expressive markets for donating to charities, The complexity of deciding reachability properties of distributed negotiation schemes, An optimal multiprocessor combinatorial auction solver, A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction, A REVIEW OF TREE CONVEX SETS TEST, Combinatorial auctions, A new branch-and-bound algorithm for the maximum weighted clique problem, Combinatorial auctions with decreasing marginal utilities, Side constraints and non-price attributes in markets, Combinatorial auctions for electronic business

Uses Software

• CABOB

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient mechanisms for bilateral trading
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Tractable combinatorial auctions and \(b\)-matching
• Computationally Manageable Combinational Auctions
• A New and Improved Design for Multiobject Iterative Auctions
• A Combinatorial Auction with Multiple Winners for Universal Service
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Algorithm for optimal winner determination in combinatorial auctions