Approaches to winner determination in combinatorial auctions

Decision Support Systems

Volumn 28, Issue 1, 2000, Pages 165-176

  Sandholm, Tuomas ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; INTERNET; RESOURCE ALLOCATION; SALES;

COMBINATORIAL AUCTIONS; ELECTRONIC COMMERCE SERVER; EXHAUSTIVE ENUMERATION; INTERNET AUCTION; MULTI AGENT SYSTEM; WINNER DETERMINATION;

ELECTRONIC COMMERCE;

EID: 0033901115     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9236(99)00066-4     Document Type: Article

References (26)

1. Andersson M.R., Sandholm T.W. Leveled commitment contracting among myopic individually rational agents. Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS), Paris, France, July. 1998;26-33.
2. Andersson M.R., Sandholm T.W. Leveled commitment contracts with myopic and strategic agents. Proceedings of the National Conference on Artificial Intelligence (AAAI), Madison, WI, July. 1998;38-45.
3. Chandra B., Halldórsson M.M. Greedy local search and weighted set packing approximation. 10th Annual SIAM-ACM Sympossium on Discrete Algorithms (SODA), January:1999.
4. Clarke E.H. Multipart pricing of public goods. Public Choice. 11:1971;17-33.
5. Groves T. Incentives in teams. Econometrica. 41:1973;617-631.
6. Halldórsson M.M. Approximations of independent sets in graphs. Jansen K., Rolim J. The First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Aalborg, Denmark, July:1998;1-14. Springer LNCS 1444.
7. Halldórsson M.M., Lau H.C. Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring. Journal of Graph Algo. Application. 1(3):1997;1-13.
8. 1-ε. Acta Mathematica. 1999;627-636. To appear. Draft: Royal Institute of Technology, Sweden, 8/11/98. Early version: Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996.
9. Hochbaum D.S. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics. 6:1983;243-254.
10. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum, New York.
11. Korf R.E. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence. 27(1):1985;97-109.
12. McAfee R.P., McMillan J. Analyzing the airwaves auction. Journal of Economic Perspectives. 10(1):1996;159-175.
13. McMillan J. Selling spectrum rights. Journal of Economic Perspectives. 8(3):1994;145-162.
14. Rassenti S.J., Smith V.L., Bulfin R.L. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics. 13:1982;402-417.
15. Rodriguez-Aguilar J.A., Noriega P., Sierra C., Padget J. FM96.5: a Java-based electronic auction house. Proceedings of the Second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM'97). 1997.
16. Rothkopf M.H., Pekeč A., Harstad R.M. Computationally manageable combinatorial auctions. Management Science. 44(8):1998;1131-1147.
17. Sandholm T.W. A strategy for decreasing the total transportation costs among area-distributed transportation centers. Nordic Operations Analysis in Cooperation (NOAS): OR in Business. 1991;Turku School of Economics, Finland.
18. Sandholm T.W. An implementation of the contract net protocol based on marginal cost calculations. Proceedings of the National Conference on Artificial Intelligence (AAAI), Washington, D.C., July. 1993;256-262.
19. T.W. Sandholm. Negotiation among self-interested computationally limited agents. PhD thesis, University of Massachusetts, Amherst, 1996. Available at http://www.cs.wustl.edu/~sandholm/dissertation.ps .
20. Sandholm T.W. Contract types for satisficing task allocation: I. Theoretical results. AAAI Spring Symposium Series: Satisficing Models. 1998;68-75 Stanford University, CA.
21. Sandholm T.W. An algorithm for optimal winner determination in combinatorial auctions. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden. 1999;542-547. Extended version: Washington University, Department of Computer Science technical report WUCS-99-01, January.
22. Sandholm T.W. eMediator: a next generation electronic commerce server. AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July. 1999;46-55. Extended version: Washington University, Department of Computer Science technical report WUCS-99-02, January.
23. Sandholm T.W., Larson K.S., Andersson M.R., Shehory O., Tohmé F. Coalition structure generation with worst case guarantees. Artificial Intelligence. 111(1-2):1999;209-238. Early version appeared at the National Conference on Artificial Intelligence (AAAI), 1998, p. 4653.
24. Sandholm T.W., Lesser V.R. Issues in automated negotiation and electronic commerce: extending the contract net framework. Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), San Francisco, CA, June. 1995;328-335. Reprinted in Huhns and Singh (Eds.), Readings in Agents, 1997, pp. 66-73.
25. Sandholm T.W., Lesser V.R. Advantages of a leveled commitment contracting protocol. Proceedings of the National Conference on Artificial Intelligence (AAAI), Portland, OR, August. 1996;126-133.
26. Wurman P.R., Wellman M.P., Walsh W.E. The Michigan Internet AuctionBot: a configurable auction server for human and software agents. Proceedings of the Second International Conference on Autonomous Agents (AGENTS), Minneapolis/St. Paul, MN, May. 1998;301-308.