Agent Competition Double-Auction Mechanism
This paper proposes an agent competition double-auction mechanism to simplify decision making and promote transactions for the customer-to-customer marketplaces. Under the proposed double-auction mechanism, bidding one's true valuation (private information) is the best strategy for each individual buyer and seller even when shipping costs and sales taxes are different across various possible transactions. The proposed mechanism also achieves budget balance and asymptotic efficiency. Furthermore, these results not only hold for an environment where buyers and sellers exchange identical commodities, but also can be extended to an environment with multiple substitutable commodities.
Volume (Year): 52 (2006)
Issue (Month): 8 (August)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:52:y:2006:i:8:p:1215-1222. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.