An improved search technique for optimal winner determination in combinatorial auctions

Proceedings of the Hawaii International Conference on System Sciences

Volumn 37, Issue , 2004, Pages 1009-1018

  Nandy, Merlin ^a   Mahanti, Ambuj ^a  

^a INDIAN INSTITUTE OF MANAGEMENT CALCUTTA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; DEGREES OF FREEDOM (MECHANICS); HEURISTIC PROGRAMMING; INFORMATION ANALYSIS; INTERNET; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; SERVERS; THRESHOLD ELEMENTS;

COMBINATORIAL AUCTIONS; CONSTRAINT PROGRAMMING; ITERATIVE THRESHOLD SEARCH (ITS); OPTIMIZATION PROBLEMS;

ELECTRONIC COMMERCE;

EID: 12344293459     PISSN: 10603425     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/hicss.2004.1265199     Document Type: Conference Paper

References (21)

1. Manoj Kumar, Stuart I. Feldman, "Business Negotiations on the Internet", IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY 10598
2. Cassady, Ralph Jr., "Auctions and Auctioneering", University of California Press, Berkeley, CA, 1967.
3. Harris, L.R., 1974. The Heuristic Search Under Conditions of Error. Artificial Intelligence 5 (3): 217-234
4. Bagchi, A., Mahanti, A., 1983. Search Algorithms Under Different Kinds of Heuristics - A Comparative Study. JACM 30(1): 1-21
5. Judea Pearl, "Heuristics", Addison-Wesley Publication Company, 1984
6. P.P. Chakrabarti, S. Ghose, A. Pandey, S.C. De Sarkar, Increasing Search Efficiency Using Multiple Heuristics, Information Processing Letters 30 (1989) 33-36
7. P.P. Chakrabarti, S. Ghose, U.K. Sarkar, S.C. De Sarkar, Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds, Artificial Intelligence 50 (1991) 207-221
8. Subrata Ghosh, Ambuj Mahanti, Dana S. Nau: ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm. AAAI 1994: 1353-1358
9. Carrie Beam, Arie Segev, and J. George Shanthikumar, "Electronic Negotiation through Internet-based Auctions", CITM Working Paper 96-WP-1019, December 1996
10. M.H. Rothkopf, A. Pekejc, R.M. Harstad, Computationally Manageable Combinatorial Auctions, Management Sci. 44 (8) (1998) 1131-1147.
11. Tuomas Sandholm. "An Algorithm for Optimal Winner Determination in Combinatorial Auctions", In IJCAI, pages 542-547, 1999., First appeared as Washington Univ., Dept. of Computer Science, WUCS-99- 01, Jan. 28th.
12. Tuomas Sandholm and Subhash Suri, "Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations", In AAAI, pages 90-97.
13. Leyton-Brown, Mark Pearson, Yoav Shoham, Towards a Universal Test Suite for Combinatorial Auction Algorithms, 2000
14. Richard E. Korf, Recent Progress in the Design and Analysis of Admissible Heuristic Functions, AAAI, 2000
15. Tuomas Sandholm, S. Suri, A. Gilpin, D. Levine, "CABOB: A Fast Optimal Algorithm for Combinatorial Auctions", in: Proc. IJCAI-01, Seattle, WA, 2001, pp. 1102-1108.
16. WE Walsh, MP Wellman, and F Ygge Combinatorial Auctions for Supply Chain Formation, Proc. IJCAI-01, Seattle, WA, 2001, pp. 1102-1108.
17. Joni L. Jones, Gary J. Koehler, An Allocation Heuristic for Combinatorial Auctions, 2001
18. Kevin Leyton-Brown and Yoav Shoham and Moshe Tennenholtz, An Algorithm for Multi-Unit Combinatorial Auctions, AAAI, 2000
19. Holger H. Hoos, Craig Boutilier, Solving Combinatorial Auctions using Stochastic Local Search, AAAI, 2000
20. Masaya Mito, Satoshi Fujita, On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions, IPSJ SIGNotes Algorithms
21. Rica Gonen, Daniel Lehmann, Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics, ACM, 2000