Computation and incentives in combinatorial public projects

The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collectively shared by the agents is chosen so as to maximize the social welfare. We explore CPPP from both a computational perspective and a mechanism design perspective. We examine CPPP in the hierarchy of complement-free (subadditive) valuation classes and present positive and negative results for both unrestricted and truthful computation.

• Type: Conference
• Year: 2010
• Where: SIGECOM
• Authors: Dave Buchfuhrer, Michael Schapira, Yaron Singer
• Keywords: Combinatorial Public Projects, ECommerce, Mechanism Design Perspective, Resource Allocation Problems, SIGECOM 2010