Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
type: Item
instance of: scholarly article
title: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
zbMATH Open document ID: 1005.91054
DOI: 10.1023/A:1011589804040
author: R. Smith
published in: Electronic Commerce Research
publication date: 2002-08-19T00:00:00Z
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 1783567
zbMATH Keywords: double auction
zbMATH Keywords: indivisible demand
zbMATH Keywords: assignment constraints
zbMATH Keywords: generalized assignment problem
zbMATH Keywords: market clearing
MaRDI profile type: Publication
full work available at URL: a:1011589804040
OpenAlex ID: W1527373281
description: scientific article; zbMATH DE number 1783567