Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand

DOI10.1023/A:1011589804040zbMath1005.91054OpenAlexW1527373281MaRDI QIDQ1610376

R. Smith

Publication date: 19 August 2002

Published in: Electronic Commerce Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011589804040

zbMATH Keywords

generalized assignment problemdouble auctionmarket clearingassignment constraintsindivisible demand

Mathematics Subject Classification ID

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

Related Items (8)

A Survey of the Generalized Assignment Problem and Its Applications ⋮ Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Combinatorial auctions ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ Design for optimized multi-lateral multi-commodity markets ⋮ A double auction based mathematical market model and heuristics for Internet-based secondhand durable good markets ⋮ Used car salesman problem: a differential auction-barter market

This page was built for publication: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand