Price determination and profit sharing for bidding groups in agent-mediated auctions

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hsu, M. C., & Soo, V. W. (2005). Price determination and profit sharing for bidding groups in agent-mediated auctions. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3371, pp. 81–91). Springer Verlag. https://doi.org/10.1007/978-3-540-32128-6_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free