On heuristics for solving winner determination problem in combinatorial auctions

Journal of Heuristics

Volumn 10, Issue 5, 2004, Pages 507-523

  Mito, Masaya ^a   Fujtta, Satoshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Combinatorial auction; e commerce; Winner determination

Indexed keywords

COMBINATORIAL AUCTION; MAXIMUM INDEPENDENT SET PROBLEM (MIS); TABU SEARCH; WINNER DETERMINATION PROBLEM (WDP);

ALGORITHMS; APPROXIMATION THEORY; ELECTRONIC COMMERCE; HEURISTIC METHODS; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COMBINATORIAL MATHEMATICS;

EID: 6944233956     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000045322.51784.2a     Document Type: Article

References (14)

1. Chang, M.-S, and F.-H. Wang. (1992). "Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs." Information Processing Letters 43(6), 293-295.
2. de Vries, S. and R. Vohra. (2003). "Combinatorial Auctions: A Survey." To appear in INFORMS Journal on Computing 15.
3. Fujishima, Y., K. Leyton-Brown, and Y. Shoham. (1999). "Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches." In Proc. IJCAI'99, pp. 548-553.
4. Halldórsson, M.M. (2000). "Approximation of Weighted Independent Set and Hereditary Subset Problems." J. of Graphs Algorithms and Applications 4(1), 1-16.
5. Harvey, W.D. and M.L. Ginsberg. (1995). "Limited Discrepancy Search." In Proc. IJCAI'95, vol. 1, pp. 607-615.
6. 1-ε." Acta Mathematica 182, 105-142.
7. Lehmann, D., L. Ita O'Callaghan, and Y. Shoham. (2002). "Truth Revelation in Approximately Efficient Combinatorial Auctions." J. of ACM 49(5), 577-602.
8. Leyton-Brown, K., M. Pearson, and Y. Shoham. (2000). "Towards a Universal Test Suite for Combinatorial Auction Algorithms." In ACM Conf. on Electronic Commerce, pp. 66-76.
9. Rothkopf, M.H., A. Pekeč, and R.M. Harstad. (1998). "Computationally Manageable Combinatorial Auctions." Management Science 44(8), 1131-1147.
10. Sakai, S., M. Togasaki, and K. Yamazaki. (2003). "A Note on Greedy Algorithms for Maximum Weighted Independent Set Problem." Discrete Applied Mathematics 126(2/3), 313-322.
11. Sakurai, Y., M. Yokoo, and K. Kamei. (2000). "An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions." In ACM Conf. on Electronic Commerce, pp. 30-37.
12. Sandholm, T. (2002). "Algorithm for Optimal Winner Determination in Combinatorial Auctions." Artificial Intelligence 135(1/2), 1-54.
13. Sandholm, T. and S. Suri. (2000). "Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations." In Proc. AAAI, pp. 90-97.
14. Sandholm, T., S. Suri, A. Gilpin, and D. Levine. (2001). "CABOB: A Fast Optimal Algorithm for Combinatorial Auctions." In Proc. IJCAI'01, pp. 1102-1108.