Combinatorial reverse auction based on lagrangian relaxation

Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008

Volumn , Issue , 2008, Pages 329-334

  Hsieh, Fu Shiung ^a   Tsai, Shih Min ^a  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC COMMERCE; INFORMATION MANAGEMENT; LAGRANGE MULTIPLIERS; MINING;

LAGRANGIAN RELAXATION; PROBLEM FORMULATION; REVERSE AUCTION; SOLUTION ALGORITHMS; SOLUTION METHODOLOGY; TOTAL COSTS; WINNER DETERMINATION PROBLEM;

COMBINATORIAL MATHEMATICS;

EID: 67049143115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSCC.2008.112     Document Type: Conference Paper

References (16)

1. de Vries, Sven; Vohra, Rakesh V. (2003) Combinatorial Auctions:A Survey, INFORMS Journal on Computing,(3):284-309
2. 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 (Pubitemid 43226351)
3. A. Pekeč and M.H. Rothkopf, Combinatorial auction design, Management Science 49 (2003), pp. 1485-1503
4. A. Andersson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 39-46, 2000
5. Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions:Optimal and approximate approaches. In Sixteenth International Joint Conference on Artificial Intelligence, pages 548-553, 1999
6. Holger H. Hoos and Craig Boutilier. Solving combinatorial auctions using stochastic local search. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 22-29, 2000
7. Tuomas Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135(1-2):1-54, 2002
8. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, and David Levine. CABOB: A fast optimal algorithm for combinatorial auctions. In IJCAI, pages 1102-1108, 2001
9. Polyak, B. T. (1969) Minimization of Unsmooth Functionals, USSR Computational Math. and Math. Physics, vol.9, pp. 14-29
10. T. Metty, R. Harlan, Q. Samelson, T. Moore, T. Morris, R. Sorensen, A. Schneur, O. Raskina, R. Schneur, J. Kanner, K. Potts and J. Robbins, Reinventing the supplier negotiation process at Motorola, Interfaces 35 (2005), pp. 7-23 (Pubitemid 40427561)
11. J.D. Murray and R.W. White, Economies of scale and economies of scope in multiproduct financial institutions: a study of British Columbia Credit Unions, The Journal of Finance 38 (1983), pp. 887-902
12. M. Rothkopf, A. Pekeč and R. Harstad, Computationally manageable combinational auctions, Management Science 44 (1998), pp. 1131-1147 (Pubitemid 128569657)
13. R.R. Vemuganti, 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 (1998), pp. 573- 746
14. R. Gonen and D. Lehmann, Optimal solutions for multiunit combinatorial auctions: branch and bound heuristics, The Proceedings of the Second ACM Conference on Electronic Commerce (EC'00) (2000), pp. 13-20
15. J.L. Jones and G.J. Koehler, Combinatorial auctions using rule-based bids, Decision Support Systems 34 (2002), pp. 59-74 (Pubitemid 34891945)
16. T. Sandholm, Approaches to winner determination in combinatorial auctions, Decision Support Systems 28 (2000), pp. 165-176 (Pubitemid 30589856)