Autonomous bidding agents in the trading agent competition

被引：38

作者：

Greenwald, A

Stone, P

机构：

[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA

[2] AT&T Labs Res, Florham Park, NJ 07932 USA

来源：

IEEE INTERNET COMPUTING | 2001年 / 5卷 / 02期

关键词：

D O I：

10.1109/4236.914648

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Task-specific details and strategies of the four top-scoring agents in a trading agent competition (TAC) were discussed. The competition challenged participants to design a trading agent capable of bidding in online simultaneous auctions for complimentary and substitutable goods. Agents had two basic activities, namely bidding and allocating. To obtain utility for the client, a TAC agent constructed a travel package for that client by placing winning bids in simultaneous auctions for hotel reservations and flights. The score of the agent was the difference between the client's utilities and the agent's expenditure.

引用

页码：52 / 60

页数：9

共 10 条

[1]

BOYAN J, 2001, ROXYBOT DYNAMIC BIDD

[2]

Cliff D., 1997, HPL97141

[3]

Cramton P, 1997, J ECON MANAGE STRAT, V6, P431

[4]

CSIRIK JA, 2001, UNPUB P 17 INT C ART

[5]

ROTH A, 2000, LATE MINUTE BIDDING

[6] Computationally manageable combinational auctions [J].

Rothkopf, MH ;

Pekec, A ;

Harstad, RM .

MANAGEMENT SCIENCE, 1998, 44 (08) :1131-1147

[7]

STONE P, 2000, LAYERED LEARNING MUL

[8]

STONE P, 2001, IN PRESS P 5 INT C A

[9]

WEBER RJ, 2001, MAKING MORE LESS STR

[10] Designing the market game for a trading agent competition [J].

Wellman, MP ;

Wurman, PR ;

O'Malley, K ;

Bangera, R ;

Lin, SD ;

Reeves, D ;

Walsh, WE .

IEEE INTERNET COMPUTING, 2001, 5 (02) :43-51

← 1 →