Decision-theoretic bidding based on learned density Models in simultaneous, interacting auctions

Journal of Artificial Intelligence Research

Volumn 19, Issue , 2003, Pages 209-242

  Stone, Peter ^a   Schapire, Robert E ^b   Littman, Michael L ^c   Csirik, János A ^d   McAllester, David ^e  

^a University of Texas at Austin   (United States)

^b Princeton University   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d D E SHAW RESEARCH   (United States)

^e TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; ESTIMATION; INTERNET; PROBLEM SOLVING;

AUCTIONS; BIDDING AGENTS; DECISION-THEORETIC BIDDING; OPTIMAL BIDS;

ELECTRONIC COMMERCE;

EID: 3242790719     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1200     Document Type: Article

References (34)

1. Anthony, P., Hall, W., Dang, V. D., & Jennings, N. R. (2001). Autonomous agents for participating in multiple on-line auctions. In Proceedings of the IJCAI-2001 Workshop on E-Business and the Intelligent Web Seattle, WA.
2. Boutilier, C. (2002). A pomdp formulation of preference elicitation problems. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 239-246.
3. Collins, M., Schapire, R. E., & Singer, Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48(1/2/3).
4. Csirik, J. A., Littman, M. L., Singh, S., & Stone, P. (2001). FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Fiege, L., Mühl, G., & Wilhelm, U. (Eds.), Electronic Commerce: Proceedings of the Second International Workshop, pp. 139-151 Heidelberg, Germany. Springer Verlag.
5. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119-139.
6. Fritschi, C., & Dorer, K. (2002). Agent-oriented software engineering for successful TAC participation. In First International Joint Conference on Autonomous Agents and Multi-Agent Systems Bologna.
7. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA.
8. Gimenez-Funes, E., Godo, L., Rodriguez-Aguiolar, J. A., & Garcia-Calves, P. (1998). Designing bidding strategies for trading agents in electronic auctions. In Proceedings of the Third International Conference on Multi-Agent Systems, pp. 136-143.
9. Ginsberg, M. L. (2001). GIB: Imperfect information in a computationally challenging game. JAIR, 14, 303-358.
10. Greenwald, A., &: Boyan, J. (2001). Bidding algorithms for simultaneous auctions. In Proceedings of Third ACM Conference on E-Commerce, pp. 115-124 Tampa, FL.
11. Harsanyi, J. (1967-1968). Games with incomplete information played by bayesian players. Management Science, 14, 159-182, 320-334, 486-502.
12. Hauskrecht, M. (1997). Incremental methods for computing bounds in partially observable Markov decision processes. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 734-739.
13. He, M., & Jennings, N. R. (2002). SouthamptonTAC: Designing a successful trading agent. In Fifteenth European Conference on Artificial Intelligence Lyon, France.
14. Ito, T., Fukuta, N., Shintani, T., & Sycara, K. (2000). Biddingbot: a multiagent support system for cooperative bidding in multiple auctions. In Proceedings of the Fourth International Conference on MultiAgent Systems, pp. 399-400.
15. Kearns, M., Mansour, Y., & Ng, A. Y. (1999). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 1324-1331.
16. Klemperer, P. (1999). Auction theory: A guide to the literature. Journal of Economic Surveys, 15(3), 227-86.
17. Littman, M. L., Majercik, S. M., & Pitassi, T. (2001). Stochastic Boolean satisfiability. Journal of Automated Reasoning, 27(3), 251-296.
18. Papadimitriou, C. H., & Tsitsiklis, J. N. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12(3), 441-450.
19. Preist, C., Bartolini, C., & Phillips, I. (2001). Algorithm design for agents which participate in multiple simultaneous auctions. In Agent Mediated Electronic Commerce III (LNAI), pp. 139-154. Springer-Verlag, Berlin.
20. Reitsma, P. S. A., Stone, P., Csirik, J. A., & Littman, M. L. (2002). Self-enforcing strategic demand reduction. In Agent Mediated Electronic Commerce IV: Designing Mechanisms and Systems, Vol. 2531 of Lecture Notes in Artificial Intelligence, pp. 289-306. Springer Verlag.
21. Rodriguez-Aguilar, J. A., Martin, F. J., Noriega, P., Garcia, P., & Sierra, C. (1998). Towards a test-bed for trading agents in electronic auction markets. AI Communications, 11 (1), 5-19.
22. Rothkopf, M. H., & Harstad, R. M. (1994). Modeling competitive bidding: A critical essay. Management Science, 40(3), 364-384.
23. Rust, J., Miller, J., & Palmer, R. (1992). Behavior of trading automata in a computerized double auction market. In Friedman, D., & Rust, J. (Eds.), The Double Auction Market: Institutions, Theories, and Evidence. Addison-Wesley, Redwood City, CA.
24. Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 57(3), 297-336.
25. Schapire, R. E., & Singer, Y. (2000). BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2/3), 135-168.
26. Stone, C. J. (1994). The use of polynomial splines and their tensor products in multivariate function estimation. The Annals of Statistics, 22(1), 118-184.
27. Stone, P., & Greenwald, A. (2003). The first international trading agent competition: Autonomous bidding agents. Electronic Commerce Research. To appear.
28. Stone, P., Littman, M. L., Singh, S., & Kearns, M. (2001). ATTac-2000: An adaptive autonomous bidding agent. Journal of Artificial Intelligence Research, 15, 189-206.
29. Tesauro, G., & Das, R. (2001). High-performance bidding agents for the continuous double auction. In Third ACM Conference on Electronic Commerce, pp. 206-209.
30. Weber, R. J. (1997). Making more from less: Strategic demand reduction in the FCC spectrum auctions. Journal of Economics and Management Strategy, 6(3), 529-548.
31. Wellman, M. P., Greenwald, A., Stone, P., & Wurman, P. R. (2002). The 2001 trading agent competition. In Proceedings of the Fourteenth Innovative Applications of Artificial Intelligence Conference, pp. 935-941.
32. Wellman, M. P., Greenwald, A., Stone, P., & Wurman, P. R. (2003a). The 2001 trading agent competition. Electronic Markets, 13(1), 4-12.
33. Wellman, M. P., Reeves, D. M., Lochner, K. M., & Vorobeychik, Y. (2003b). Price prediction in a trading agent competition. Tech. rep., University of Michigan.
34. Wellman, M. P., Wurman, P. R., O'Malley, K., Bangera, R., Lin, S.-d., Reeves, D., & Walsh, W. E. (2001). A trading agent competition. IEEE Internet Computing, 5(2), 43-51.