Solving concisely expressed combinatorial auction problems

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 359-366

  Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SEMANTICS;

MARKET MECHANISMS;

COMBINATORIAL MATHEMATICS;

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

References (16)

1. Arne Andersson, Mattias Tenhunen, and Fredrik Ygge. Integer programming for combinatorial auction winner determination. In Proceedings of the Fourth International Conference on Multiagent Systems, pages 39-46, Boston, 2000.
2. Craig Boutilier and Holger H. Hoos. Bidding languages for combinatorial auctions. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 1211-1217, Seattle, 2001.
3. Vijay Chandru and John N. Hooker. Optimization Methods for Logical Inference. Wiley, New York, 1999.
4. Yuzo Fujisima, Kevin Leyton-Brown, and Yoav Shoham. Taming the computational complexity of combinatorial auctions. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 548-553, Stockholm, 1999.
5. Holger H. Hoos and Craig Boutilier. Solving combinatorial auctions using stochastic local search. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 22-29, Austin, TX, 2000.
6. Noa E. Kfir-Dahav, Dov Monderer, and Moshe Tennenholtz. Mechanism design for resource bounded agents. In Proceedings of the Fourth International Conference on Multiagent Systems, Boston, 2000.
7. Kevin Leyton-Brown, Mark Pearson, and Yoav Shoham. Towards a universal test suite for combinatorial auction algorithms. In ACM Conference on Electronic Commerce (EC-2000), pages 66-76, Minneapolis, MI, 2000.
8. Noam Nisan. Bidding and allocations in combinatorial auctions. In ACM Conference on Electronic Commerce (EC-2000), pages 1-12, Minneapolis, MI, 2000.
9. Noam Nisan and Amir Ronen. Computationally feasible VCG mechanisms. In ACM Conference on Electronic Commerce (EC-2000), pages 242-252, Minneapolis, MI, 2000.
10. S. J. Rassenti, V. L. Smith, and R. L. Bulfin. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics, 13:402-417, 1982.
11. Michael H. Rothkopf, Aleksander Pekeč, and Ronald M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131-1147, 1998.
12. Tuomas Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 542-547, Stockholm, 1999. Extended version, Washington Univ. Report WUCS-99-01.
13. Tuomas Sandholm. eMediator: a next generation electronic commerce server. In Proceedings of the Fourth International Conference on Autonomous Agents, pages 341-348, Barcelona, 2000.
14. Tuomas Sandholm, Subash Suri, Andrew Gilpin, and David Levine. CABOB: A fast optimal algorithm for combinatorial auctions. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 1102-1108, Seattle, 2001.
15. Dale Schuurmans, Finnegan Southey, and Robert C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 334-341, Seattle, 2001.
16. Michael P. Wellman, William E. Walsh, Peter R. Wurman, and Jeffrey K. MacKie-Mason. Auction protocols for decentralized scheduling. Games and Economic Behavior, 35:271-303, 2001.