Exact Algorithms for the Matrix Bid Auction

DOI10.1007/978-3-540-72845-0_33MaRDI QIDQ5432329zbMATH OpenOpenAlexFDO

Authors Frits C. R. Spieksma, Dries R. Goossens

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/120979

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

Recommendations

• Exact algorithms for the matrix bid auction
• Matrix bidding in combinatorial auctions
• Algorithms for recognizing economic properties in matrix bid combinatorial auctions
• Exact methods for combinatorial auctions. (Abstract of Thesis)
• Algorithm for optimal winner determination in combinatorial auctions

Cited in

(6)

• Algorithms for recognizing economic properties in matrix bid combinatorial auctions
• Matrix bidding in combinatorial auctions
• A branch-and-price algorithm and new test problems for spectrum auctions
• scientific article; zbMATH DE number 1748492 (Why is no real title available?)
• Exact methods for combinatorial auctions. (Abstract of Thesis)
• Exact algorithms for the matrix bid auction

This page was built for publication: Exact Algorithms for the Matrix Bid Auction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432329)