Mechanism Design for Team Formation

Team formation is a core problem in AI. Remarkably, little prior work has addressed the problem of mechanism design for team formation, accounting for the need to elicit agents' preferences over potential teammates. Coalition formation in the related hedonic games has received much attention, but only from the perspective of coalition stability, with little emphasis on the mechanism design objectives of true preference elici-tation, social welfare, and equity. We present the first formal mechanism design framework for team formation, building on recent combinatorial matching market design literature. We exhibit four mechanisms for this problem, two novel, two simple extensions of known mechanisms from other domains. Two of these (one new, one known) have desirable theoretical properties. However, we use extensive experiments to show our second novel mechanism, despite having no theoretical guarantees, empirically achieves good incentive compatibility, welfare, and fairness.

[1]  A. Roth,et al.  The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.

[2]  Yevgeniy Vorobeychik,et al.  Average-case analysis of VCG with approximate resource allocation algorithms , 2011, Decis. Support Syst..

[3]  Katarína Cechlárová,et al.  Stability in coalition formation games , 2000, Int. J. Game Theory.

[4]  Katia P. Sycara,et al.  Mechanism design for coalition formation and cost sharing in group-buying markets , 2004, Electron. Commer. Res. Appl..

[5]  Leandro Soriano Marcolino,et al.  Multi-Agent Team Formation: Diversity Beats Strength? , 2013, IJCAI.

[6]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[7]  Eric Budish,et al.  Matching "versus" mechanism design , 2012, SECO.

[8]  Tayfun Sönmez,et al.  Core in a simple coalition formation game , 2001, Soc. Choice Welf..

[9]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[10]  Coralio Ballester,et al.  NP-completeness in hedonic games , 2004, Games Econ. Behav..

[11]  Felix Brandt,et al.  Stable partitions in additively separable hedonic games , 2011, AAMAS.

[12]  Immo Diener,et al.  Fixed point theorems for discontinuous mapping , 1991, Math. Program..

[13]  Eric Budish,et al.  The Multi-Unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard , 2010 .

[14]  Tuomas Sandholm,et al.  Finding approximate competitive equilibria: efficient and fair course allocation , 2010, AAMAS.

[15]  H. Varian Equity, Envy and Efficiency , 1974 .

[16]  R. J. Aumann,et al.  Cooperative games with coalition structures , 1974 .

[17]  Atila Abdulkadiroglu,et al.  School Choice: A Mechanism Design Approach , 2003 .

[18]  José Alcalde,et al.  Researching with whom? Stability and manipulation , 2004 .