摘要
It is a common behavior that a group of rational agents cooperate together as a bidder/seller to bid in an auction. How to determine the group bidding price and how to share the profit among the members in a group has been problems that are not studied thoroughly. In time-critical auctions, the problem is getting more complicated since the group has to decide new bidding prices within time limits. Conventional approaches used a centralized mechanism to assign profit share to each bidding agent in the group that usually lead to negative profit of individual bidding agent. We propose a distributed approach called Z-process that allows individual bidding agents to declare their compromised profit share based on their rationalities, and determines the group bidding prices simultaneously. We show that in Z-process there exists a dominant strategy for rational agents that can let them obtain maximum profit. We can also show that the compromised profit of each individual bidding agent by Z-process satisfies each agent's rationality.
| 原文 | 英語 |
|---|---|
| 頁(從 - 到) | 81-91 |
| 頁數 | 11 |
| 期刊 | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) |
| 卷 | 3371 |
| DOIs | |
| 出版狀態 | 已出版 - 2005 |
| 對外發佈 | 是 |
| 事件 | 7th Pacific Rim International Workshop on Multi-Agents, PRIMA 2004 - Auckland, 新西蘭 持續時間: 08 08 2004 → 13 08 2004 |
指紋
深入研究「Price determination and profit sharing for bidding groups in agent-mediated auctions」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver