A Truthful, Privacy-Preserving, Approximately Efficient Combinatorial Auction For Single-minded Bidders

Combinatorial auctions are widely used to sell resources/items. The challenges in such auctions are multi-fold. We need to ensure that bidders, the strategic agents, bid their valuations truthfully to the auction mechanism. Besides, the agents may desire privacy of their identities as well as their bidding information. We consider three types of privacies: agent privacy, the identities of the losing bidders must not be revealed to any other agent except the auctioneer (AU), bid privacy, the bid values must be hidden from the other agents as well as the AU and bid-topology privacy, the items for which the agents are bidding must be hidden from the other agents as well as the AU. In this paper, we address whether can we solve the allocation and payment determination problems, which are NP-hard, approximately for single-minded bidders while preserving privacy. In the literature, root m-approximation, where m is the number of items auctioned, and a strategy-proof mechanism is available for this, which we refer to as ICA-SM. To implement ICA-SM with privacy, we propose a novel cryptographic protocol TPACAS. We show that TPACAS achieves these privacy guarantees with high probability. To accomplish this, we use notaries who are semi-trusted third parties. We show that, in TPACAS, notaries do not learn any information about the agents and their bidding information.


Published in:
Aamas '19: Proceedings Of The 18Th International Conference On Autonomous Agents And Multiagent Systems, 1916-1918
Presented at:
18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), Montreal, CANADA, May 13-17, 2019
Year:
Jan 01 2019
Publisher:
New York, ASSOC COMPUTING MACHINERY
ISBN:
978-1-4503-6309-9
Keywords:
Laboratories:




 Record created 2019-08-14, last modified 2019-08-30


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)