Secure computation for combinatorial auctions and market exchanges

Josiane Nzouonta, Marius Cǎlin Silaghi, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

It was recently shown possible to solve (M+1) st price single item auctions without revealing absolutely any secret except for the solution. Namely, with vMB-share [2], the seller and the buyer only learn each other's identity and learn the selling price for a chosen (M+1) st pricing scheme. No trusted party is necessary. In this paper we show how vMB-share can be extended for the clearing of combinatorial negotiation problems with several items, buyers and sellers. We first show how the more general problem can be reduced to a virtual form, form that is relatively similar to the single item auctions, by having a virtual bidder for each candidate allocation. Then, some modifications in the cryptographic techniques of vMB-share are made such that it can offer a solution to problems in virtual form. As explained in the paper, it is expected that a secure solution hiding details that can be inferred from the running time will have an exponential computation cost. Our preliminary experimental evaluation shows that some small negotiations can nevertheless be solved with acceptable effort.

Original languageEnglish
Title of host publicationProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
EditorsN.R. Jennings, C. Sierra, L. Sonenberg, M. Tambe
Pages1398-1399
Number of pages2
Publication statusPublished - Sep 27 2004
Externally publishedYes
EventProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 - New York, NY, United States
Duration: Jul 19 2004Jul 23 2004

Publication series

NameProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
Volume3

Other

OtherProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
CountryUnited States
CityNew York, NY
Period7/19/047/23/04

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Nzouonta, J., Silaghi, M. C., & Yokoo, M. (2004). Secure computation for combinatorial auctions and market exchanges. In N. R. Jennings, C. Sierra, L. Sonenberg, & M. Tambe (Eds.), Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 (pp. 1398-1399). (Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004; Vol. 3).