Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding

Proceedings of the ACM Conference on Electronic Commerce

Volumn 5, Issue , 2003, Pages 25-30

  Dang, Viet Dung ^a   Jennings, Nicholas R ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Auctions; Intelligent Agents; Winner Determination

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; EXTRAPOLATION; LINEAR SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

AUCTIONS; OPTIMAL ALLOCATION; WINNER DETERMINATION;

INTELLIGENT AGENTS;

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

References (10)

1. V. D. Dang and N. R. Jennings. Optimal clearing algorithms for forward and reverse combinatorial auctions with demand/supply function bidding. Technical report, University of Southampton, 2002.
2. V. D. Dang and N. R. Jennings. Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions. In Proc. 15th European Conf. on AI, pages 23-27, 2002.
3. A. Davenport and J. Kalagnanam. Price negotiations for procurement of direct inputs. IBM Research Report RC 22078, 2001.
4. M. Eso, S. Ghosh, J. Kalagnanam, and L. Ladanyi. Bid evaluation in procurement auctions with piece-wise linear supply curves. IBM Research Report RC 22219, 2001.
5. Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and ap-proximate approaches. In Proc. 16th Intl. Joint Conf. on AI, pages 548-553, 1999.
6. R. Gonen and D. Lehmann. Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. In Proc. 2nd ACM Conf. on Electronic Commerce, pages 13-20, 2000.
7. N. Nisan. Bidding and allocation in combinatorial auctions. In Proc. 2nd ACM Conf. on Electronic Commerce, pages 1-12, 2000.
8. T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In Proc. 16th Intl. Joint Conf. on AI, pages 542-547, 1999.
9. T. Sandholm and S. Suri. Market clearability. In Proc. of 17th Intl. Joint Conf. on AI, pages 1145-1151, 2001.
10. T. Sandholm, S. Suri, A. Gilpin, and D. Levine. Winner determination in combinatorial auction generalizations. In Proc. 1st Intl. Joint Conf. on Autonomous Agents and Multiagent Systems, pages 69-76, 2002.