A New Method for Complex Goods Selection in Electronic Markets

Authors: Mohammad Ali Tabarzad, Caro Lucas, Nassim Jafarzadeh Eslami

Abstract:

After the development of the Internet a suitable discipline for trading goods electronically has been emerged. However, this type of markets is not still mature enough in order to become independent and get closer to seller/buyer-s needs. Furthermore, the buyable and sellable goods in these markets still don-t have essential standards for being well-defined. In this paper, we will present a model for development of a market which can contain goods with variable definitions and we will also investigate its characteristics. Besides, by noticing the fact that people have different discriminations, it-s figured out that the significance of each attribute of a specific product may vary from different people-s view points. Consequently we-ll present a model for weighting and accordingly different people-s view points could be satisfied. These two aspects will be discussed completely throughout this paper.

Keywords: Electronic markets, selection of multi attributegoods, data infusion.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1071776

References:

[1] Michael H. Rothkopf, Aleksandar Pekec, and Ronald M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131-1147, 1998.
[2] Ran Lavi and Noam Nisan. Competitive analysis of incentive compatible on-line auctions. In Proceedings of the Second ACM Conference on Electronic Commerce, pages 233-241, 2000.
[3] Noam Nisan. Bidding and allocation in combinatorial auctions. In Proceedings of the Second ACM Conference on Electronic Commerce, pages 1-12, 2000.
[4] Tuomas W. Sandholm. Approach to winner determination in combinatorial auctions. Decision Support Systems, 28(1-2):165-176, 2000.
[5] Tuomas W. Sandholm and Subhash Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 90-97, 2000.
[6] Tuomas W. Sandholm, Subhash Suri, Andrew Gilpin, and David Levine. cabob: A fast optimal algorithm for combinatorial auctions. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 1102-1108, 2001.
[7] Rica Gonen and Daniel Lehmann. Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. In Proceedings of the Second ACM Conference on Electronic Commerce, pages 13-20, 2000.
[8] Rica Gonen and Daniel Lehmann. Linear programming helps solving large multi-unit combinatorial auctions. In Proceedings of the Electronic Market Design Workshop, 2001.
[9] Eugene Fink, Jianli Gong, and John Hershberger. Multi-attribute exchange market: Search for optimal matches. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2004.
[10] Eugene Fink, Joshua Marc Johnson and Jenny Ying Hu. Exchange market for complex goods: Theory and experiments. Netnomics, 6(1):21-42, 2004.
[11] Marlon Dumas, Boualem Benatallah, Nick Russell and Murray Spork. A configurable matchmaking framework for electronic marketplaces. Electronic Commerce Research and Applications 3(1):pp. 95-106, 2004.
[12] Tuomas W. Sandholm and Subhash Suri. Market clearability. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 1145-1151, 2001.
[13] Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. In Proceedings of the Third acm Conference on Electronic Commerce, pages 18-28, 2001.
[14] Martin Bichler. An experimental analysis of multi attribute auctions. Decision Support Systems, 29(3):249-268, 2000.
[15] Eugene Fink, Josh Johnson, and John Hershberger. Fast-paced trading of multi-attribute goods. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pages 4280-4287, 2003.
[16] Tuomas W. Sandholm and Subhash Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations.In Proceesings of the Seventeenth National Conference on Artificial Intelligence, pages 90-97, 2000.
[17] Jayant R. Kalagnanam, Andrew J. Davenport, and Ho S. Lee. Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Technical Report RC21660(97613), IBM, 2000.
[18] Eugene Fink, Josh Johnson, and Jenny Hu. Exchange market for complex goods: Theory and experiments. Netnomics, 6(1), pages 21-42, 2004.