Combinatorial Auction. Conbinatorial auction t 1 =20 t 2 =15 t 3 =6 f(t): the set X F with the highest total value the mechanism decides the set of winners.
Mechanisms with Verification Carmine Ventre Teesside University.
A Truthful 2-approximation Mechanism for the Steiner Tree Problem.
Mechanisms with Verification
Towards a Characterization of Truthful Combinatorial Auctions
Optimal Collusion-Resistant Mechanisms with Verification
Price of Anarchy in Games of Incomplete Information
