A Fair Mechanism for Recurrent Multi-unit Auctions

Auctions are a good tool for dealing with resource allocation in multi-agent environments. When the resources are either renewable or perishable, a repeated auction mechanism is needed, in what is known as recurrent auctions. However, several problems arise with this kind of auction, namely, the resource waste problem, the bidder drop problem, and the asymmetric balance of negotiation power. In this paper we present different mechanisms to deal with these issues. We have evaluated the mechanisms in a network bandwidth allocation scenario, and the results show that the proposed mechanisms achieve higher benefits for the auctioneer, while also providing a fairer behavior.