Competition May Increase Social Utility in Bipartite Matching Problem

Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise. It can be applied to many real-world scenarios and explain many social phenomena. In this article, we study the effect of competition on bipartite matching problem by introducing conformity into the preference structure. The results show that a certain amount of competition can improve the overall utility of society and also eliminate the giant shift of social utility when matching unequal numbers of men and women.

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

[2]  Gui-Yuan Shi,et al.  Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women , 2018, Complex..

[3]  Yi-Cheng Zhang.  Happier World with More Information , 2001 .

[4]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[5]  V. Dotsenko.  Exact solution of the random bipartite matching model , 1999, cond-mat/9911477.

[6]  M. Marsili,et al.  Scaling behavior in the stable marriage problem , 1997 .

[7]  Yi-Cheng Zhang,et al.  Matching games with partial information , 2003 .

[8]  R. Italy,et al.  Beauty and distance in the stable marriage problem , 2000, cond-mat/0008337.

[9]  Alvin E. Roth,et al.  The Economics of Matching: Stability and Incentives , 1982, Math. Oper. Res..

[10]  Hao Liao,et al.  Analysis of ground state in random bipartite matching , 2015, ArXiv.

[11]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[12]  Laurent Viennot,et al.  On Using Matching Theory to Understand P2P Network Design , 2006, ArXiv.

[13]  Giorgio Parisi,et al.  The Euclidean matching problem , 1988 .

[14]  Michael Dzierzawa,et al.  Statistics of stable marriages , 2000 .

[15]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[16]  Boris G. Pittel,et al.  The Average Number of Stable Matchings , 1989, SIAM J. Discret. Math..

[17]  Ekram Hossain,et al.  Distributed Resource Allocation in 5G Cellular Networks , 2014, ArXiv.

[18]  Bruce M. Maggs,et al.  Algorithmic Nuggets in Content Delivery , 2015, CCRV.

[19]  Yi-Cheng Zhang,et al.  Statistical Mechanics of Competitive Resource Allocation , 2013, 1305.2121.

[20]  Robert Fox.  Information economy , 2018, Digit. Libr. Perspect..

[21]  Rath Vannithamby,et al.  Towards 5G: Applications, Requirements and Candidate Technologies , 2016 .

[22]  Günter J. Hitsch,et al.  Matching and Sorting in Online Dating , 2008 .

[23]  M. Mézard,et al.  Replicas and optimization , 1985 .