Incorporating Trust into Combinatorial Auctions: What Does Trust Cost?
Pages 607 - 613
Abstract
As the use of automated negotiations becomes more mainstream, one key attribute that needs to be incorporated is a measure of a seller's trust or reliability. In this paper, we describe a combinatorial auction mechanism that allows buyers to specify their preferences over both an item and the seller's trustworthiness, and use it to generate a bid for a bundle of items. We consider some implications of generating a combined trust rating for a bundle of resources that are supplied by more than one seller. We show that allowing buyers to specify trust preferences leads to a higher overall utility and task completion rate than when compared with a model that does not consider seller trustworthiness.
References
[1]
G. Airy, T. Mullen, and J. Yen, "Market based Adaptive Resource Allocation for Distributed Rescue Teams", In Proceedings of the 6th International Information Systems for Crisis Response and Management (ISCRAM) Conference, Gothenburg, Sweden, May 2009.
[2]
M. Bichler, An Experimental Analysis of Multi-Attribute Auctions, Decision Support Systems, 29(3), pp. 249-268, October 2000.
[3]
P. J. Brewer, "Decentralized computation procurement and computational robustness in a smart market", Economic Theory, 13, pp. 41-92, January 1999.
[4]
buySafe Inc, Turning the Risk Discount into a Trust Premium buySafe Inc, 2005. Online. Available: http://www.buysafe.com.
[5]
Y. Che, "Design Competition through Multidimensional Auctions", Rand Journal of Economics, 24(4), pp. 668-680, Winter 1993.
[6]
E. K. Clemons, J. Grass, and S. Woda, "buySAFE: Creating and Profiting from the Bonded Seller Advantage," 40th Annual Hawaii International Conference on System Sciences, HICSS 2007, Hawaii, USA, pp. 212b-212b, January 2007.
[7]
P. Cramton, "Spectrum auctions", In M. Cave, S. Majumdar, and I. Vogelsang (Eds.), Handbook of Telecommunications Economics, Elsevier, Amsterdam, The Netherlands, Chapter 14, pp. 605-639, September 2002.
[8]
P. Cramton, Y. Shoham, and R. Steinberg, "An overview of combinatorial auctions", SIGecom Exchange, 7(1), December 2007.
[9]
S. de Vries, and R. V. Vohra, "Combinatorial auctions: A survey," INFORMS Journal on Computing, 15(3), pp. 284-309, July 2003.
[10]
D. Dolgov, and E. Durfee, "Computationally-efficient combinatorial auctions for resource allocation in weakly-coupled MDPs", In Proceedings of the Fourth international Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS '05, Utrecht, The Netherlands, pp. 657-664, July 2005.
[11]
D. Gambetta, "Can We Trust Trust?", In D. Gambetta, editor, Trust: Making and Breaking Cooperative Relations, pp. 213- 238, Basil Blackwell, Oxford, 1990.
[12]
A. Giovannucci, J. A. Rodriguez-Aguilar, M. Vinyals, J. Cerquides, and U. Endriss, "Mixed multi-unit combinatorial auctions for supply chain management", SIGecom Exch. 7(1), pp. 58-60, December 2007.
[13]
A. Jøsang, and S. Hird, "Simulating the effect of reputation systems on e-Markets", Proceedings of the 1st international conference on trust management, pp. 179-194, Crete, Greece, May 2003.
[14]
J. Nzouonta, M. Silaghi, and M. Yokoo, "Secure Computation for Combinatorial Auctions and Market Exchanges", In Proceedings of the Third international Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3, International Conference on Autonomous Agents. IEEE Computer Society, Washington, DC, USA, pp. 1398-1399, July 2004.
[15]
R. Porter, A. Ronen, Y. Shoham, and M. Tennenholtz, "Fault tolerant mechanism design", Artificial Intelligence, 172(15), pp. 1783-1799, October 2008.
[16]
I. Rahwan, R. Kowalczyk, and H. H. Pham, "Intelligent agents for automated one-to-many e-commerce negotiation", In Proceedings of the Twenty-Fifth Australasian Conference on Computer Science - Volume 4 (Melbourne, Victoria, Australia). Conferences in Research and Practice in Information Technology Series, Vol. 17. Australian Computer Society, Darlinghurst, Australia, pp. 197-204, 2002.
[17]
S. D. Ramchurn, T. D. Huynh, and R. Jennings, "Trust in multiagent systems", The Knowledge Engineering Review, 19(1), pp. 1-25, March 2004.
[18]
T. Sandholm, S. Suri and A. Gilpin, "CABOB: A fast optimal algorithm for winner determination in combinatorial auctions", Management Science, 51(3), pp. 374-391, 2005.
[19]
T. Suyama, and M. Yokoo, "Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction", In Proceedings of the Third international Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, IEEE Computer Society, Washington, DC, USA, pp. 160-167, July 2004.
[20]
G. Zacharia, A. Moukas, and P. Maes, "Collaborative reputation mechanisms for electronic marketplaces", Decision Support Systems, 29(4), pp. 371-388, December 2002.
[21]
W. Zhang, "Computational Trust Model in Online Auctions," International Conference on Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007, Shanghai, China, pp.3767-3770, pp. 21-25, September 2007.
Index Terms
- Incorporating Trust into Combinatorial Auctions: What Does Trust Cost?
Recommendations
Bayesian Combinatorial Auctions
We study the following simple Bayesian auction setting: m items are sold to n selfish bidders in m independent second-price auctions. Each bidder has a private valuation function that specifies his or her complex preferences over all subsets of items. ...
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
In combinatorial auctions using VCG, a seller can sometimes increase revenue by dropping bidders. In this paper we investigate the extent to which this counterintuitive phenomenon can also occur under other deterministic, dominant-strategy combinatorial ...
A pricing scheme for combinatorial auctions based on bundle sizes
In combinatorial auctions not only single items but also bundles of items are sold simultaneously. A substantial ingredient to an auction mechanism is the way prices of bundles are determined. Prices determine the auctioneer's revenue and, ideally, ...
Comments
Information & Contributors
Information
Published In
September 2009
638 pages
ISBN:9780769538013
Sponsors
Publisher
IEEE Computer Society
United States
Publication History
Published: 15 September 2009
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in