Solving the combinatorial double auction problem

DOI10.1016/j.ejor.2003.11.018zbMath1132.91451OpenAlexW2034406377MaRDI QIDQ707121

Andrew B. Whinston, Mu Xia, Jan I. A. Stallaert

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.11.018

zbMATH Keywords

Artificial intelligenceInteger programmingBranch-and-boundAnalysis of algorithmsBidding-auctions

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (3)

A double auction based mathematical market model and heuristics for Internet-based secondhand durable good markets ⋮ Block order restrictions in combinatorial electric energy auctions ⋮ Design of a combinatorial double auction for local energy markets

Uses Software

• CABOB

Cites Work

• Computationally Manageable Combinational Auctions
• Optimal Investment in Knowledge Within a Firm Using a Market Mechanism
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Solving the combinatorial double auction problem