Bibliography

Anthony, Hall, Dang, JenningsAnthony et al.2001

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.

BoutilierBoutilier2002

Boutilier, C. 2002.
A pomdp formulation of preference elicitation problems
In Proceedings of the Eighteenth National Conference on Artificial Intelligence, 239-246.

Collins, Schapire, SingerCollins et al.2002

Collins, M., Schapire, R. E., Singer, Y. 2002.
Logistic regression, AdaBoost and Bregman distances
Machine Learning, 48(1/2/3).

Csirik, Littman, Singh, StoneCsirik et al.2001

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., Electronic Commerce: Proceedings of the Second International Workshop, 139-151 Heidelberg, Germany. Springer Verlag.

Freund SchapireFreund Schapire1997

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.

Fritschi DorerFritschi Dorer2002

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.

Garey JohnsonGarey Johnson1979

Garey, M. R. Johnson, D. S. 1979.
Computers and Intractability: A Guide to the Theory of NP-completeness.
Freeman, San Francisco, CA.

Gimenez-Funes, Godo, Rodriguez-Aguiolar, Garcia-CalvesGimenez-Funes et al.1998

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, 136-143.

GinsbergGinsberg2001

Ginsberg, M. L. 2001.
GIB: Imperfect information in a computationally challenging game
JAIR, 14, 303-358.

Greenwald BoyanGreenwald Boyan2001

Greenwald, A. Boyan, J. 2001.
Bidding algorithms for simultaneous auctions
In Proceedings of Third ACM Conference on E-Commerce, 115-124 Tampa, FL.

HarsanyiHarsanyi1968

Harsanyi, J. 1967-1968.
Games with incomplete information played by bayesian players
Management Science, 14, 159-182,320-334,486-502.

HauskrechtHauskrecht1997

Hauskrecht, M. 1997.
Incremental methods for computing bounds in partially observable Markov decision processes
In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 734-739.

He JenningsHe Jennings2002

He, M. Jennings, N. R. 2002.
SouthamptonTAC: Designing a successful trading agent
In Fifteenth European Conference on Artificial Intelligence Lyon, France.

Ito, Fukuta, Shintani, SycaraIto et al.2000

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, 399-400.

Kearns, Mansour, NgKearns et al.1999

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), 1324-1331.

KlempererKlemperer1999

Klemperer, P. 1999.
Auction theory: A guide to the literature
Journal of Economic Surveys, 13(3), 227-86.

Littman, Majercik, PitassiLittman et al.2001

Littman, M. L., Majercik, S. M., Pitassi, T. 2001.
Stochastic Boolean satisfiability
Journal of Automated Reasoning, 27(3), 251-296.

Papadimitriou TsitsiklisPapadimitriou Tsitsiklis1987

Papadimitriou, C. H. Tsitsiklis, J. N. 1987.
The complexity of Markov decision processes
Mathematics of Operations Research, 12(3), 441-450.

Preist, Bartolini, PhillipsPreist et al.2001

Preist, C., Bartolini, C., Phillips, I. 2001.
Algorithm design for agents which participate in multiple simultaneous auctions
In Agent Mediated Electronic Commerce III (LNAI), 139-154. Springer-Verlag, Berlin.

Reitsma, Stone, Csirik, LittmanReitsma et al.2002

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, 2531 of Lecture Notes in Artificial Intelligence, 289-306. Springer Verlag.

Rodriguez-Aguilar, Martin, Noriega, Garcia, SierraRodriguez-Aguilar et al.1998

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.

Rothkopf HarstadRothkopf Harstad1994

Rothkopf, M. H. Harstad, R. M. 1994.
Modeling competitive bidding: A critical essay
Management Science, 40(3), 364-384.

Rust, Miller, PalmerRust et al.1992

Rust, J., Miller, J., Palmer, R. 1992.
Behavior of trading automata in a computerized double auction market
In Friedman, D. Rust, J., The Double Auction Market: Institutions, Theories, and Evidence. Addison-Wesley, Redwood City, CA.

Schapire SingerSchapire Singer1999

Schapire, R. E. Singer, Y. 1999.
Improved boosting algorithms using confidence-rated predictions
Machine Learning, 37(3), 297-336.

Schapire SingerSchapire Singer2000

Schapire, R. E. Singer, Y. 2000.
BoosTexter: A boosting-based system for text categorization
Machine Learning, 39(2/3), 135-168.

StoneStone1994

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.

Stone GreenwaldStone Greenwald2003

Stone, P. Greenwald, A. 2003.
The first international trading agent competition: Autonomous bidding agents
Electronic Commerce Research.
To appear.

Stone, Littman, Singh, KearnsStone et al.2001

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.

Tesauro DasTesauro Das2001

Tesauro, G. Das, R. 2001.
High-performance bidding agents for the continuous double auction
In Third ACM Conference on Electronic Commerce, 206-209.

WeberWeber1997

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.

Wellman, Greenwald, Stone, WurmanWellman et al.2002

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, 935-941.

Wellman, Greenwald, Stone, WurmanWellman et al.2003a

Wellman, M. P., Greenwald, A., Stone, P., Wurman, P. R. 2003a.
The 2001 trading agent competition
Electronic Markets, 13(1), 4-12.

Wellman, Reeves, Lochner, VorobeychikWellman et al.2003b

Wellman, M. P., Reeves, D. M., Lochner, K. M., Vorobeychik, Y. 2003b.
Price prediction in a trading agent competition
, University of Michigan.

Wellman, Wurman, O'Malley, Bangera, Lin, Reeves, WalshWellman et al.2001

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.