Close category search window
 

Bidding Decision on Open Group-buying Online Auction Based on Multi-price Levels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bai Xiao-hong ; Inst. of Syst. Eng., Dalian Univ. of Technol., Dalian ; Deng Gui-shi

Group-buying online auction (GBA) is a new kind of dynamic pricing mechanisms. Most of researches on the GBA focus on B2C, and the researches under the B2B just focus on two-price levels without considering multi-price levels. To solve this problem, this paper analyzes the bidderpsilas optimal decision with the case that each bidder bids independently based on the B2B open group-buying online auction, with which, the seller will sell products to the bidders with the certain arrival information, and obtains the bidderpsilas optimal bidding decision based on the idea of newsboy model. Compared to the bidding decision under the fixed price, the bidderpsilas optimal bidding decision with certain arrival information under multi-price levels is much better.

Published in:
Modelling, Simulation and Optimization, 2008. WMSO '08. International Workshop on

Date of Conference: 27-28 Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.