Decision processes in agent-based automated contracting

被引：19

作者：

Collins, J ^{[1
]}

Bilot, C

Gini, M

Mobasher, B

机构：

[1] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA

[2] Depaul Univ, Ctr Web Intelligence, Chicago, IL 60604 USA

来源：

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

基金：

美国国家科学基金会;

关键词：

Expected utility theory;

D O I：

10.1109/4236.914649

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Business-to-business e-commerce is growing rapidly and moving towards auction based pricing mechanism, inspite of many problems and risk factors evolved in coordinated tasks. To determine the winning bids is the main problem in markets with coordinated tasks as picking the lowest price is not sufficient. The systematic approach reliably finds the optimum bid assignment, at the cost of exponential scalability and anytime controllability. A vocabulary must be developed to allow unambiguous specifications of tasks and bids.

引用

页码：61 / 72

页数：12

共 10 条

[1] Integer programming for combinatorial auction winner determination [J].

Andersson, A ;

Tenhunen, M ;

Ygge, F .

FOURTH INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS, PROCEEDINGS, 2000, :39-46

[2]

[Anonymous], 1997, DECISION MAKING UNCE

[3]

[Anonymous], 1995, RISK EVALUATION MANA

[4]

Collins J., 1998, Proceedings of the Second International Conference on Autonomous Agents, P285, DOI 10.1145/280765.280845

[5]

Collins J., 2000, Proceedings of the Fourth International Conference on Autonomous Agents, P247, DOI 10.1145/336595.337464

[6]

COLLINS J, 2000, LNAI, V1788

[7]

Hillier F.S., 1990, Introduction to operations research, V5th ed.

[8]

Nisan N., 2000, EC'00. Proceedings of the 2nd ACM Conference on Electronic Commerce, P1, DOI 10.1145/352871.352872

[9]

Reeves CR., 1993, Modern Heuristic Techniques for Combinatorial Problems

[10] Approaches to winner determination in combinatorial auctions [J].

Sandholm, T .

DECISION SUPPORT SYSTEMS, 2000, 28 (1-2) :165-176

← 1 →