Heuristics for a bidding problem

Computers and Operations Research

Volumn 33, Issue 8, 2006, Pages 2179-2188

  Guo, Y ^a   Lim, A ^b   Rodrigues, B ^c   Zhu, Y ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

Artificial intelligence; Bidding; Heuristics

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; HEURISTIC METHODS;

BIDDING; NON-EXACT METHOD; PACKING PROBLEM;

PROBLEM SOLVING;

EID: 29144452436     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.01.007     Document Type: Article

References (13)

1. Fujishima Y, Leyton-Brown K, Shoham Y. Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. Sixteenth international joint conference on artificial intelligence, 1999, p. 548-53.
2. Andersson A, Tenhunen M, Ygge F. Integer programming for combinatorial auction winner determination. Proceedings of fourth international conference on multiagent systems, 2000, p. 39-46.
3. T. Sandholm Algorithms for optimal winner determination in combinatorial auctions Artif Intell 135 1-2 1999 1 54
4. Hoos H, Boutilier C. Solving combinatorial auctions using stochastic local search. Proceedings of the 17th national conference on artificial intelligence, 2000, p. 22-9.
5. Lau HC, Goh, YG. An intelligent brokering system to support multi-agent web-based 4th-party logistics. Proceedings of the 14th international conference on tools with artificial intelligence, 2002, p. 154-61.
6. S. de Vries, and R. Vohra Combinatorial auctions a survey INFORMS J Comput 15 2003 284 309
7. Leyton-Brown K, Pearson M, Shoham Y. Towards a universal test suite for combinatorial auction algorithms. ACM conference on electronic commerce, 2000, p. 66-76.
8. Sandholm T, Suri S, Gilpin A, Levine D. CABOB: a fast optimal algorithm for combinatorial auctions. International joint conferences on artificial intelligence, 2001, p. 1102-8.
9. Guo Y, Lim A, Rodrigues B, Zhu Y. Heuristics for a brokering set packing problem. Proceedings of eighth international symposium on artificial intelligence and mathematics, 2004, p. 10-14.
10. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
11. Hudson B, Sandholm T. Effectiveness of preference elicitation in combinatorial auctions. AAMAS-02 workshop on agent-mediated electronic commerce (AMEC), 2002, p. 69-86.
12. Schuurmans D, Southey F, Holte RC. The exponentiated subgradient algorithm for heuristic boolean programming. International joint conference on artificial intelligence, 2001, p. 334-41.
13. Sandholm T, Suri S, Gilpin A, Levine D. Winner determination in combinatorial auction generalizations, 2001. AGENTS-2001 workshop on agent-based approaches to B2B, Montreal, Canada.