A comparative study of two combinatorial reverse auction models

PACIS 2010 - 14th Pacific Asia Conference on Information Systems

Volumn , Issue , 2010, Pages 248-259

  Hsieh, Fu Shiung ^a   Huang, Chung Wei ^a  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Combinatorial auction; E Commerce; Group buying; Winner determination

Indexed keywords

BUSINESS MODELS; COMBINATORIAL AUCTION; COMPARATIVE STUDIES; COST SHARING; EFFECTIVE TOOL; GROUP BUYING; IF THERE ARE; REVERSE AUCTION; TOTAL COSTS; WINNER DETERMINATION;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; COST REDUCTION; EFFICIENCY; INFORMATION SYSTEMS; ONLINE SYSTEMS; SALES;

ELECTRONIC COMMERCE;

EID: 84862940475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Dolan, R. (1987). Quantity discounts: managerial issues and research opportunities. Marketing Science, 6(1), 1-22.
2. Kauffman, R. J. and Wang, B. ( 2002). Bid together, buy together: on the efficiency of group-buying business models in internet-based selling. In P. Lowry, J. Cherrington, and R. Watson, editors, Handbook of Electronic Commerce in Business and Society. CRC Press.
3. Kauffman, R. J. and Wang, B.( 2001) New buyer's arrival under dynamic pricing market microstructure: the case of group-buying discounts on the internet. Journal of Management Information Systems, 18(2):157-188.
4. Anand, K. S. and Aron, R..( 2003). Group buying on the web: A comparison of price-discovery mechanisms. Management Science, 49(11):1546-1562.
5. Chen, J., Chen, X. and Song, X. (2002). Bidder's strategy under group-buying auction on the internet. IEEE Transactions on Systems, Man and Cybernetics Part A: Systems and Humans, 32(6): 680-690.
6. Chen, J., Chen, X. and Song, X. (2007). Comparison of the group-buying auction and the fixed pricing mechanism. Decision Support System, 43(2):445-459.
7. Li, C., Sycara, K. and Scheller-Wolf, A. (2009). Combinatorial coalition formation for multi-item group-buying with heterogeneous customers, To appear, Decision Support System, doi:10.1016/j.dss.2009.12.002.
8. de Vries, Sven; Vohra, Rakesh V. (2003). Combinatorial Auctions:A Survey, INFORMS Journal on Computing, (3):284-309.
9. Guo, Y. Lim, A. Rodrigues, B. Tang, J. (2005). Using a Lagrangian heuristic for a combinatorial auction problem, In Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence.
10. Pekeč, A. and Rothkopf, M.H. (2003). Combinatorial auction design, Management Science 49, pp. 1485-1503.
11. Andersson, A., Tenhunen, M. and Ygge, F. (2000) Integer programming for combinatorial auction winner determination, In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 39-46.
12. Fujishima, Y., Leyton-Brown, K. and Shoham, Y. (1999). Taming the computational complexity of combinatorial auctions:Optimal and approximate approaches, In Sixteenth International Joint Conference on Artificial Intelligence, pages 548-553.
13. Holger H. Hoos and Craig Boutilier (2000) Solving combinatorial auctions using stochastic local search, In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 22-29.
14. Sandholm, T. (2002). Algorithm for optimal winner determination in combinatorial auctions, Artificial Intelligence, 135(1-2):1-54.
15. Sandholm, T., S. Suri, Gilpin, A. and Levine, D. (2001). CABOB: A fast optimal algorithm for combinatorial auctions. In IJCAI, pages 1102-1108.
16. Polyak, B. T. (1969) Minimization of Unsmooth Functionals, USSR Computational Math. and Math. Physics, vol. 9, pp. 14-29.
17. Metty, T., Harlan, R., Samelson, Q., Moore, T., Morris, T., Sorensen, R., Schneur, A., Raskina, O., Schneur, R., Kanner, J., Potts, K. and Robbins, J. (2005). Reinventing the supplier negotiation process at Motorola, Interfaces 35, pp. 7-23.
18. Murray, J.D. and White, R.W. (1983). Economies of scale and economies of scope in multiproduct financial institutions: a study of British Columbia Credit Unions, The Journal of Finance 38, pp. 887-902.
19. Rothkopf, M., Pekeč, A. and Harstad, R. (1998). Computationally manageable combinational auctions, Management Science 44, pp. 1131-1147.
20. Vemuganti, R.R. (1998). Applications of set covering, set packing and set partitioning models: a survey. In: D.-Z. Du, Editor, Handbook of Combinatorial Optimization Vol. 1, Kluwer Academic Publishers, Netherlands, pp. 573-746.
21. Gonen, R. and Lehmann, D. (2000). Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics, The Proceedings of the Second ACM Conference on Electronic Commerce (EC'00), pp. 13-20.
22. Jones, J.L. and Koehler, G.J. (2002). Combinatorial auctions using rule-based bids, Decision Support Systems 34, pp. 59-74.
23. Sandholm, T. (2000). Approaches to winner determination in combinatorial auctions, Decision Support Systems 28, pp. 165-176.
24. Hsieh, Fu-Shiung (2007) Combinatorial Auction with Minimal Resource Requirements, Lecture Notes in Artificial Intelligence, vol. 4570, pp. 1072-1077.
25. Hsieh, Fu-Shiung and Shih-Min Tsai (2008) Combinatorial Reverse Auction based on Lagrangian Relaxation, " Proceedings of 2008 IEEE Asia-Pacific Services Computing Conference, pp. 329-334.
26. Hsieh, Fu-Shiung (2009) Combinatorial Reverse Auction Algorithm for Group Buying, The 2009 International Workshop on Mobile Systems, E-commerce, and Agent Technology (MSEAT 2009).
27. Hsieh, Fu-Shiung (2010) Combinatorial reverse auction based on revelation of Lagrangian multipliers, Decision Support Systems, Volume 48, Issue 2, pp. 323-330.