Frugality ratios and improved truthful mechanisms for vertex cover
Proceedings of the 8th ACM conference on Electronic commerce
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Auctions for structured procurement
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We study the problem of procuring a cheap path in a disjoint path graph in which the edges belong to self interested agents. A wide range of task allocation problems can be reduced to this problem [2]. Motivated by recent negative results regarding incentive compatible mechanisms for the problem, our focus is on non incentive compatible mechanisms. Such mechanisms have both good and bad equilibria and therefore it is not clear how to analyze them. In this paper we take first steps towards the construction of generic low payment mechanisms for task allocation. We focus on simple mechanisms conveying minimal amount of information to the agents. By simulation, we investigate the behavior of the agents during repeated executions of the mechanism. We study three adaptive strategies for the agents, each represents a different learning approach. Our goal is to pinpoint phenomena which are consistent across all three types of strategies. We demonstrate that it may be possible to achieve long range payments overwhelmingly smaller than the payments of incentive compatible mechanisms. Several recommendations which facilitate obtaining low payments along with advises for avoiding pitfalls are given in the paper.