Combinatorial auctions and knapsack problems

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Volumn 3, Issue , 2004, Pages 1280-1281

  Kelly, Terence ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY DISPOSAL COSTS; COMBINATIONAL AUCTION (CA); KNAPSACK PROBLEMS (KP); WINNER DETERMINATION PROBLEMS (WDP);

ALGORITHMS; BENCHMARKING; DYNAMIC PROGRAMMING; MULTI AGENT SYSTEMS; OPERATIONS RESEARCH; PROBLEM SOLVING; RESEARCH AND DEVELOPMENT MANAGEMENT;

ELECTRONIC COMMERCE;

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

References (4)

1. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
2. T. Kelly. Generalized knapsack solvers for multi-unit combinatorial auctions. Technical Report HPL-2004-21, HP Labs, Feb. 2004.
3. A. Kothari, D. C. Parkes, and S. Suri. Approximatelystrategyproof and tractable multi-unit auctions. In ACM E-Commerce, June 2003.
4. K. Leyton-Brown, M. Pearson, and Y. Shoham. Towards a universal test suite for combinatorial auction algorithms. In ACM E-Commerce, Oct. 2000.