Generalized assignment problem: Truthful mechanism design without money

We propose truthful approximation mechanisms for strategic variants of the generalized assignment problem (GAP) in a payment-free environment. In GAP, a set of items has to be optimally assigned to a set of bins without exceeding the capacity of any singular bin. In our strategic variant, bins are held by strategic agents and each agent may hide its willingness to receive some items in order to obtain items of higher values. The model has applications in auctions with budgeted bidders.

[1]  Gagan Goel,et al.  On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Robert D. Carr,et al.  Randomized metarounding , 2002, Random Struct. Algorithms.

[3]  Martin Bichler,et al.  Truthfulness and Approximation with Value-Maximizing Bidders , 2016, SAGT.

[4]  M. Satterthwaite,et al.  Strategy-proofness and single-peakedness , 1976 .

[5]  Harriet Ortiz,et al.  Proceedings of the twenty-second annual ACM symposium on Theory of computing , 1990, STOC 1990.

[6]  B. Peleg,et al.  Strategy-proof voting schemes with continuous preferences , 1990 .

[7]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

[8]  Chaitanya Swamy,et al.  Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9]  Robert D. Carr,et al.  Randomized metarounding (extended abstract) , 2000, STOC '00.

[10]  A. Gibbard.  Manipulation of Voting Schemes: A General Result , 1973 .

[11]  Ning Chen,et al.  Truthful Generalized Assignments via Stable Matching , 2014, Math. Oper. Res..

[12]  Shaddin Dughmi,et al.  Truthful assignment without money , 2010, EC '10.

[13]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[14]  Elias Koutsoupias,et al.  Scheduling Without Payments , 2011, Theory of Computing Systems.

[15]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[16]  M. Satterthwaite.  Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .