ScholarLens Back to search
2005•Zhongguo guanli kexueRequires access

An Optimization Model for Combinatorial Double Auction Based on Integer Programming Method

Liang Liang

Open publisher page 0 citations

Abstract

Combinatorial double auction(CDA) combines combinatorial auction and double auction.Compared with combinatorial auction and double auction,there is very litter documented research on CDA due to its complexity.An optimization model for combinatorial double auction based on integer programming method is established and transformed into single-sided auction,which will benefit to solve combinatorial double auction with the method used for single-sided auction and to make the problem much more easier.

About this research paper

What this paper is about

Combinatorial double auction(CDA) combines combinatorial auction and double auction.Compared with combinatorial auction and double auction,there is very litter documented research on CDA due to its complexity.An optimization model for combinatorial double auction based on integer programming method is established and transformed into single-sided auction,which will benefit to solve combinatorial double auction with the method used for single-sided auction and to make the problem much more easier.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Combinatorial double auction(CDA) combines combinatorial auction and double auction.Compared with combinatorial auction and double auction,there is very litter documented research on CDA due to its complexity.An optimization model for combinatorial double auction based on integer programming method is established and transformed into single-sided auction,which will benefit to solve combinatorial double auction with the method used for single-sided auction and to make the problem much more easier.

Key concepts: Combinatorial auction, Auction algorithm, Double auction, Computer science, Reverse auction, Integer programming, Auction theory, Generalized second-price auction

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Optimization Model for Combinatorial Double Auction Based on Integer Programming Method — Research Paper | ScholarLens