False-name-proof Mechanisms for hiring a team

This paper develops two new false-name-proof auction mechanisms for hiring a team. In the problem of hiring a team, each agent is assumed to own one or more edges of a set system, and the auctioneer is trying to purchase a feasible solution to perform a task by conducting an auction. We introduce two models of false-name manipulations in hiring a team auctions and propose the MP and AP mechanisms, that are robust against false-name manipulations. Furthermore, we show the frugality ratio of MP is bounded by n2", and that of AP is bounded by reserve cost, which is choosen a priori by the auctioneer.