A Novel Auction Mechanism for Selling Time-Sensitive E-Services
CEC '05 Proceedings of the Seventh IEEE International Conference on E-Commerce Technology
Fairness in multi-agent systems
The Knowledge Engineering Review
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Fair Mechanism for Recurrent Multi-unit Auctions
MATES '08 Proceedings of the 6th German conference on Multiagent System Technologies
Negotiating socially optimal allocations of resources
Journal of Artificial Intelligence Research
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Hi-index | 0.00 |
Auctions have been used to deal with resource allocation in multi-agent systems. In some environments like service-oriented electronic markets, it is advisable to use recurrent auctions since resources are perishable and auctions are repeated over time with the same or a very similar set of agents. Recurrent auctions are a series of auctions of any kind where the result of one auction may influence the following one. As a drawback some problems do appear that could cause the market to collapse at mid-long term. Previous works have dealt with these problems by adding fairness to the auction outcomes. Those works dealt with multi-unit auctions, in which several units of an item are sold, and they do not assure that agents cannot manipulate the auctions for their own benefit. In this paper, we present new fair mechanisms that goes further. First we focus on combinatorial auctions, in which different items, and several units per item are sold in each auction, which poses additional challenges when they are recurrent. And second, the mechanisms are shown to prevent some agents' manipulation of the auction outcomes.