TY - GEN
T1 - Winner determination in online multi-attribute reverse auction under incomplete information settings
AU - Fu, Li Fang
AU - Feng, Yu Qiang
PY - 2007
Y1 - 2007
N2 - The 'winner determination problem(WDP)' is a computationally hard problem in multi-attribute reverse auction (MARA), especially when there are incomplete or indeterminate information about auctioneer's preference and the values of commodity attributes in sellers' bids. In the paper, a method for winner determination in online MARA was proposed, and an algorithm of the method was developed based on the theories of multi-criteria decision analysis (MCDA). All the bids received by auctioneer are evaluated through pair-wise comparisons and the preference degree between paired bids is calculated according to the conception of possibility degree. Finally, all the bids are ranked based on their ranking indexes and the winner of the auction is determined. It was demonstrated that die method can incorporate several types of incomplete or indeterminate information as long as they can be expressed in the form of linear inequalities. Moreover, it was proofed that the ranking order be consistent with the partial information on auctioneer's preference. A computational example was presented which verified the efficiency of the method.
AB - The 'winner determination problem(WDP)' is a computationally hard problem in multi-attribute reverse auction (MARA), especially when there are incomplete or indeterminate information about auctioneer's preference and the values of commodity attributes in sellers' bids. In the paper, a method for winner determination in online MARA was proposed, and an algorithm of the method was developed based on the theories of multi-criteria decision analysis (MCDA). All the bids received by auctioneer are evaluated through pair-wise comparisons and the preference degree between paired bids is calculated according to the conception of possibility degree. Finally, all the bids are ranked based on their ranking indexes and the winner of the auction is determined. It was demonstrated that die method can incorporate several types of incomplete or indeterminate information as long as they can be expressed in the form of linear inequalities. Moreover, it was proofed that the ranking order be consistent with the partial information on auctioneer's preference. A computational example was presented which verified the efficiency of the method.
KW - Incomplete information
KW - Multi-attribute reverse auction
KW - Possibility-degree
KW - Ranking index
KW - Winner determination
UR - https://www.scopus.com/pages/publications/40549135989
U2 - 10.1109/ICSSSM.2007.4280230
DO - 10.1109/ICSSSM.2007.4280230
M3 - 会议稿件
AN - SCOPUS:40549135989
SN - 1424408857
SN - 9781424408856
T3 - Proceedings - ICSSSM'07: 2007 International Conference on Service Systems and Service Management
BT - Proceedings - ICSSSM'07
T2 - ICSSSM'07: 2007 International Conference on Service Systems and Service Management
Y2 - 9 June 2007 through 11 June 2007
ER -