Bilateral Negotiation With Fees

Abstract

Bilateral negotiation over a single good or service is a fundamental problem for automated systems, and is surprisingly resistant to general solutions. In this paper we offer advice and new results for the design of electronic negotiation and market systems. We review the theoretical and experimental literature as guide to pragmatic design. We then investigate how some well-studied simple mechanisms could be extended with transaction and entry fees to improve their efficiency or their budget balance. The goal is to support pragmatic design for online automated transactions. We find that an iterated Generalized Vickrey Auction with fees can maintain budget balance and improve trading efficiency over a single-shot GVA. For k-double auctions we find that when processing costs are a function of the number of bids then efficiency favors entry fees, while transactions fees are favored if processing costs are a function of the number of transactions. We present simulations to support our theoretical conclusions.