A New Dynamic Auction Mechanism in the Supply Chain: N-Bilateral Optimized Combinatorial Auction(N-BOCA)

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 884
  • Download : 493
In this paper, we introduce a new combinatorial auction mechanism - N-Bilateral Optimized Combinatorial Auction (N-BOCA). N-BOCA is a flexible iterative combinatorial auction model that offers optimized trading for multi-suppliers and multi-purchasers in the supply chain. We design the N-BOCA system from the perspectives of architecture, protocol, and trading strategy. Under the given N-BOCA architecture and protocol, auctioneers and bidders have diverse decision strategies for winner determination. This needs flexible modeling environments. Hence, we propose an optimization modeling agent for bid and auctioneer selection. Finally, we show the viability of N-BOCA through prototype and experiments. The results say both higher allocation efficiency and effectiveness compared with 1-to-N general combinatorial auction mechanisms.
Publisher
Korea Intelligent Information Systems Society
Issue Date
2006-03
Keywords

Combinatorial auction; n-bilateral optimized combinatorial auction; model formulation; supply chain

Citation

Journal of Korea Intelligent Information Systems Society, Vol. 12, No. 1, 2006. 3, pp. 139-161(23)

ISSN
1229-4152
URI
http://hdl.handle.net/10203/5112
Link
http://www.dbpia.co.kr/view/ar_view.asp?arid=742916
http://acms.kisti.re.kr/retrieve/index.jsp?soc=kiiss&lang=kor&pg=Detail
http://www.kiiss.or.kr/
Appears in Collection
KGSF-Conference Papers(학술회의논문)
Files in This Item
2005-103.pdf(3.37 MB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0