CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
From MaRDI portal
Publication:3115456
DOI10.1287/mnsc.1040.0336zbMath1232.91329OpenAlexW2109649220MaRDI QIDQ3115456
No author found.
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9492
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
An effective discrete dynamic convexized method for solving the winner determination problem, A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction, An interactive approach for bi-attribute multi-item auctions, Strong activity rules for iterative combinatorial auctions, Alternative formulations for the set packing problem and their application to the winner determination problem, Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles, Computing optimal outcomes under an expressive representation of settings with externalities, Information-theoretic approaches to branching in search, Pricing combinatorial auctions., A new approach for modeling and solving set packing problems, Trading grid services - a multi-attribute combinatorial approach, A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, Exact algorithms for the matrix bid auction, A market-based multi-agent system model for decentralized multi-project scheduling, Combinatorial auctions, Heuristics for a bidding problem, Solving the combinatorial double auction problem, The communication requirements of efficient allocations and supporting prices, A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions, Truthful approximation mechanisms for restricted combinatorial auctions, Solving multiple scenarios in a combinatorial auction, GreedEx---a scalable clearing mechanism for utility computing, CABOB, Non-linear anonymous pricing combinatorial auctions, Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support, Market-based pricing in grids: on strategic manipulation and computational cost, Combinatorial auctions for electronic business, Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction
Uses Software
